prathwik0 / design-and-analysis-algorithms-in-c

Design and Analysis of Algorithms in C

Design and Analysis of Algorithms (DAA) in C

No.	Title	Algorithms	Time Complexity	Space Complexity
	Euclid's algorithm		Euclid's algorithm adf $asdf$asdf	asdf $asdf$ asdf Euclid's algorithm
	Consecutive Integer		Euclid's algorithm

List of programs

No.	Title	Algorithms	Time Complexity	Space Complexity
1	GCD	Euclid's algorithm	$ O(log(\min(a,b))) $	O(1)

No.	Title	Algorithms	Time Complexity	Space Complexity
		Consecutive Integer	$O(\min(a,b))$	$O(1)$
		Middle School Method	$O(n)$	$O(maxFactors)$
2	Prime Numbers	Sieve of Eratosthenes	$O(n\log\log n)$	$O(n)$
3	Factorial	Iterative Version

No.	Title	Algorithms	Time Complexity	Space Complexity
		Recursive Version	$O(n!)$
4	Fibonacci	Iterative Version
		Recursive Version	$O(2^n)$
5	Tower of Hanoi	Tower of Hanoi	$O(2^n)$	$O(n)$
6	Matrices	Matrix Multiplication	$O(n^3)$	$O(n^2)$

No.	Title	Algorithms	Time Complexity	Space Complexity
7	Searching Algorithms	Linear Search	$\Omega(1)\ \Theta(n)\ O(n)$	$O(1)$
		Binary Search	$\Omega(1)\ \Theta(\log n)\ O(\log n)$	$O(1)$
8	Sorting Algorithms	Bubble Sort	$\Omega(n)\ \Theta(n^2)\ O(n^2)$	$O(1)$
		Selection Sort	$\Omega(n^2)\ \Theta(n^2)\ O(n^2)$	$O(1)$
		Insertion Sort	$\Omega(n)\ \Theta(n^2)\ O(n^2)$	$O(1)$

No.	Title	Algorithms	Time Complexity	Space Complexity
		Merge Sort	$\Omega(n\log n)\ \Theta(n\log n)\ O(n\log n)$	$O(n)$
		Quick Sort	$\Omega(n\log n)\ \Theta(n\log n)\ O(n^2)$	$O(1)$
9	Graph Algorithms	Depth First Search
		Breadth First Search
10	String Matching	Brute Force
		Horspool Algorithm