Table of Contents generated with DocToc
- Hi, I'm Saurabh! 👋
- Algorithms By Princeton
- Day - 01 -> Introduction to Algorithms
- Day - 02 -> Union Find & Analysis of Algorithms
- Day - 03 -> Stacks, Queues and Elementary Sorts
- Day - 04 -> Merge Sort & Quick Sort
- Day - 05 -> Priority Queue and Heap
- Day - 06 -> Symbol Tables & Binary Search Tree
- Day - 07 -> Balanced Search Tree
- Day - 08 -> Geometric Search
- Day - 09 -> Hash Tables
- Feedback
https://www.coursera.org/learn/algorithms-part1
https://www.coursera.org/learn/algorithms-part2
This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations. Part I covers elementary data structures, sorting, and searching algorithms. Part II focuses on graph- and string-processing algorithms. All the features of this course are available for free. It does not offer a certificate upon completion.
Quick Find
Quick Union
Quick Find Applications
Analysis of Algorithms
Theory of Algorithms
Order of Growth
Stacks
Queues
Generics
Iterators
Resizing Array
Stack & Queue Applications
Randomized Dequeue
Knuth Shuffle
Convex Hull
Selection Sort
Bubble Sort
Insertion Sort
Shell Sort
Recursive Merge Sort
Bottom-Up Merge Sort
Sorting Complexity
Comparators
Quick Sort
Quick Select
Dijkstra Three Way - Duplicate Keys
System Sorts
Priority Queue
Max Binary Heap
Min Binary Heap
Heap Sort
Symbol Table
Insert
Delete
Find min
Find max
Level Order
InOrder - Recursive & Iterative
PreOrder - Recursive & Iterative
PostOrder - Recursive & Iterative
Balanced Search Trees
Red Black BST
B-Tree
Geometric Search
Kd-Trees
Hash Function
Separate Chaining
Linear Probing
Hash Table Context
If you have any feedback, please reach out at skmahajan4998@gmail.com