Anastasoff/Coursera.org

Homeworks

Coursera.org

Princeton University - Algorithms, Part I

1. [Union Find] (https://github.com/Anastasoff/Coursera.org/tree/master/Princeton%20University%20-%20Algorithms%20Part%20I/01.UnionFind)

• [QuickFindUF] (https://github.com/Anastasoff/Coursera.org/blob/master/Princeton%20University%20-%20Algorithms%20Part%20I/01.UnionFind/UnionFind/QuickFindUF.cs)
• [QuickUnionUF] (https://github.com/Anastasoff/Coursera.org/blob/master/Princeton%20University%20-%20Algorithms%20Part%20I/01.UnionFind/UnionFind/QuickUnionUF.cs)
• [WeightedQuickUnionUF] (https://github.com/Anastasoff/Coursera.org/blob/master/Princeton%20University%20-%20Algorithms%20Part%20I/01.UnionFind/UnionFind/WeightedQuickUnionUF.cs)
• [PathCompressionQuickUnionUF] (https://github.com/Anastasoff/Coursera.org/blob/master/Princeton%20University%20-%20Algorithms%20Part%20I/01.UnionFind/UnionFind/PathCompressionQuickUnionUF.cs)

2. [Analysis of Algorithms] (https://github.com/Anastasoff/Coursera.org/tree/master/Princeton%20University%20-%20Algorithms%20Part%20I/02.AnalysisOfAlgorithms)

• [BinarySearch] (https://github.com/Anastasoff/Coursera.org/blob/master/Princeton%20University%20-%20Algorithms%20Part%20I/02.AnalysisOfAlgorithms/AnalysisOfAlgorithms/BinarySearch.cs)
• [ThreeSum] (https://github.com/Anastasoff/Coursera.org/blob/master/Princeton%20University%20-%20Algorithms%20Part%20I/02.AnalysisOfAlgorithms/AnalysisOfAlgorithms/ThreeSum.cs)
• [ThreeSumDeluxe] (https://github.com/Anastasoff/Coursera.org/blob/master/Princeton%20University%20-%20Algorithms%20Part%20I/02.AnalysisOfAlgorithms/AnalysisOfAlgorithms/ThreeSumDeluxe.cs)

3. [Stacks and Queues] (https://github.com/Anastasoff/Coursera.org/tree/master/Princeton%20University%20-%20Algorithms%20Part%20I/03.StacksAndQueues)

• [FixedCapacityStackOfStrings] (https://github.com/Anastasoff/Coursera.org/blob/master/Princeton%20University%20-%20Algorithms%20Part%20I/03.StacksAndQueues/Stacks/Static/FixedCapacityStackOfStrings.cs)
• [ResizingArrayStackOfStrings] (https://github.com/Anastasoff/Coursera.org/blob/master/Princeton%20University%20-%20Algorithms%20Part%20I/03.StacksAndQueues/Stacks/Static/ResizingArrayStackOfStrings.cs)
• [FixedCapacityStack] (https://github.com/Anastasoff/Coursera.org/blob/master/Princeton%20University%20-%20Algorithms%20Part%20I/03.StacksAndQueues/Stacks/Static/FixedCapacityStack.cs)
• [LinkedStackOfStrings] (https://github.com/Anastasoff/Coursera.org/blob/master/Princeton%20University%20-%20Algorithms%20Part%20I/03.StacksAndQueues/Stacks/Dynamic/LinkedStackOfStrings.cs)
• [GenericStack] (https://github.com/Anastasoff/Coursera.org/blob/master/Princeton%20University%20-%20Algorithms%20Part%20I/03.StacksAndQueues/Stacks/Dynamic/GenericStack.cs)
• [LinkedQueueOfStrings] (https://github.com/Anastasoff/Coursera.org/blob/master/Princeton%20University%20-%20Algorithms%20Part%20I/03.StacksAndQueues/Queues/LinkedQueueOfStrings.cs)

4. [Elementary Sorts] (https://github.com/Anastasoff/Coursera.org/tree/master/Princeton%20University%20-%20Algorithms%20Part%20I/04.ElementarySorts)

• [Selection sort] (https://github.com/Anastasoff/Coursera.org/blob/master/Princeton%20University%20-%20Algorithms%20Part%20I/04.ElementarySorts/SelectionSort/Selection.cs)
• [Insertion sort] (https://github.com/Anastasoff/Coursera.org/blob/master/Princeton%20University%20-%20Algorithms%20Part%20I/04.ElementarySorts/InsertionSort/Insertion.cs)
• [InsertionX sort] (https://github.com/Anastasoff/Coursera.org/blob/master/Princeton%20University%20-%20Algorithms%20Part%20I/04.ElementarySorts/InsertionSort/InsertionX.cs)
• [Shell sort] (https://github.com/Anastasoff/Coursera.org/blob/master/Princeton%20University%20-%20Algorithms%20Part%20I/04.ElementarySorts/ShellSort/Shell.cs)
• [Bubble sort] (https://github.com/Anastasoff/Coursera.org/blob/master/Princeton%20University%20-%20Algorithms%20Part%20I/04.ElementarySorts/BubbleSort/Bubble.cs)

5. [Mergesort] (https://github.com/Anastasoff/Coursera.org/tree/master/Princeton%20University%20-%20Algorithms%20Part%20I/05.MergeSort)

• [Mergesort] (https://github.com/Anastasoff/Coursera.org/blob/master/Princeton%20University%20-%20Algorithms%20Part%20I/05.MergeSort/MergeSort/Merge.cs)
• [MergeXsort] (https://github.com/Anastasoff/Coursera.org/blob/master/Princeton%20University%20-%20Algorithms%20Part%20I/05.MergeSort/MergeSort/MergeX.cs)
• [MergeBUsort] (https://github.com/Anastasoff/Coursera.org/blob/master/Princeton%20University%20-%20Algorithms%20Part%20I/05.MergeSort/MergeSort/MergeBU.cs)

6. [Quicksort] (https://github.com/Anastasoff/Coursera.org/tree/master/Princeton%20University%20-%20Algorithms%20Part%20I/06.Quicksort)

• [Quicksort] (https://github.com/Anastasoff/Coursera.org/blob/master/Princeton%20University%20-%20Algorithms%20Part%20I/06.Quicksort/Quicksort/Quick.cs)
• [QuickXsort] (https://github.com/Anastasoff/Coursera.org/blob/master/Princeton%20University%20-%20Algorithms%20Part%20I/06.Quicksort/Quicksort/QuickX.cs)
• [Quick3waysort] (https://github.com/Anastasoff/Coursera.org/blob/master/Princeton%20University%20-%20Algorithms%20Part%20I/06.Quicksort/Quicksort/Quick3way.cs)

7. [Priority Queues] (https://github.com/Anastasoff/Coursera.org/tree/master/Princeton%20University%20-%20Algorithms%20Part%20I/07.PriorityQueues)

• [MaxPQ] (https://github.com/Anastasoff/Coursera.org/blob/master/Princeton%20University%20-%20Algorithms%20Part%20I/07.PriorityQueues/MaxPQ/MaxPQ.cs)
• [MinPQ] (https://github.com/Anastasoff/Coursera.org/blob/master/Princeton%20University%20-%20Algorithms%20Part%20I/07.PriorityQueues/MinPQ/MinPQ.cs)
• [PriorityQueue] (https://github.com/Anastasoff/Coursera.org/blob/master/Princeton%20University%20-%20Algorithms%20Part%20I/07.PriorityQueues/PriorityQueue/PriorityQueue.cs)
• [HeapSort] (https://github.com/Anastasoff/Coursera.org/blob/master/Princeton%20University%20-%20Algorithms%20Part%20I/07.PriorityQueues/HeapSort/Heap.cs)

8. [Elementary Symbol Tables] (https://github.com/Anastasoff/Coursera.org/tree/master/Princeton%20University%20-%20Algorithms%20Part%20I/08.ElementarySymbolTables)

• [SequentialSearchST] (https://github.com/Anastasoff/Coursera.org/blob/master/Princeton%20University%20-%20Algorithms%20Part%20I/08.ElementarySymbolTables/SymbolTables/SequentialSearchST.cs)
• [BinarySearchST] (https://github.com/Anastasoff/Coursera.org/blob/master/Princeton%20University%20-%20Algorithms%20Part%20I/08.ElementarySymbolTables/SymbolTables/BinarySearchST.cs)
• [BinarySearchTree] (https://github.com/Anastasoff/Coursera.org/blob/master/Princeton%20University%20-%20Algorithms%20Part%20I/08.ElementarySymbolTables/SymbolTables/BinarySearchTree.cs)

9. [Balanced Search Trees] (https://github.com/Anastasoff/Coursera.org/tree/master/Princeton%20University%20-%20Algorithms%20Part%20I/09.BalancedSearchTrees)

• [RedBlackBST] (https://github.com/Anastasoff/Coursera.org/blob/master/Princeton%20University%20-%20Algorithms%20Part%20I/09.BalancedSearchTrees/BalancedSearchTrees/RedBlackBST.cs)
• [BTree] (https://github.com/Anastasoff/Coursera.org/blob/master/Princeton%20University%20-%20Algorithms%20Part%20I/09.BalancedSearchTrees/BalancedSearchTrees/BTree.cs)

10. [Hash Tables] (https://github.com/Anastasoff/Coursera.org/tree/master/Princeton%20University%20-%20Algorithms%20Part%20I/10.HashTables)

• [LinearProbingHashST] (https://github.com/Anastasoff/Coursera.org/blob/master/Princeton%20University%20-%20Algorithms%20Part%20I/10.HashTables/HashSymbolTables/LinearProbingHashST.cs)
• [SeparateChainingHashST] (https://github.com/Anastasoff/Coursera.org/blob/master/Princeton%20University%20-%20Algorithms%20Part%20I/10.HashTables/HashSymbolTables/SeparateChainingHashST.cs)