Scribd
Upload
2 views1 page

Algorithm Notes Overview

The document outlines key concepts in algorithms, including complexity notations (Big O, Big Ω, Big Θ) and various sorting methods (bubble, merge, quick, heap). It also covers searching techniques (linear, binary, hash tables), graph algorithms (BFS, DFS, Dijkstra, Kruskal, Prim), dynamic programming examples (Fibonacci, Knapsack, LCS), and greedy algorithms (activity selection, Huffman coding). Overall, it serves as a concise reference for fundamental algorithmic principles.

Uploaded by

hassanmi2005
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views1 page

Algorithm Notes Overview

The document outlines key concepts in algorithms, including complexity notations (Big O, Big Ω, Big Θ) and various sorting methods (bubble, merge, quick, heap). It also covers searching techniques (linear, binary, hash tables), graph algorithms (BFS, DFS, Dijkstra, Kruskal, Prim), dynamic programming examples (Fibonacci, Knapsack, LCS), and greedy algorithms (activity selection, Huffman coding). Overall, it serves as a concise reference for fundamental algorithmic principles.

Uploaded by

hassanmi2005
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Algorithms Notes

1. Complexity: Big O, Big Ω, Big Θ.

2. Sorting: bubble, merge, quick, heap.

3. Searching: linear, binary, hash tables.

4. Graph Algorithms: BFS, DFS, Dijkstra, Kruskal, Prim.

5. Dynamic Programming: Fibonacci, Knapsack, LCS.

6. Greedy Algorithms: activity selection, Huffman coding.

You might also like