Coursera - Algorithms, Part I

Code in C# for programming lessons taught during the Coursera course, Algorithms Part I.

Week 1 - Union Find

• QUICK FIND - A Quick Find implementation, array based.
• QUICK UNION - A Quick Union implementation, array based.
• WEIGHTED QUICK UNION PATH COMPRESSION - A Weighted Quick Union implementation with Path Compression, array based.

Week 2 - Queues, Stacks and Bags / Sorting

• QUEUE using Linked List - A generic double ended queue implementation, double-linked list based.
• STACK using Linked List - A stack implementation, linked list based.
• STACK using Fixed Size Array - A stack implementation, fixed size array based.
• STACK using Resizing Array - A generic stack implementation, resizing array based.
• GENERIC STACK using Linked List - A generic stack implementation, linked list based with Iteration.
• GENERIC STACK using Fixed Size Array - A generic stack implementation, fixed size array based with Iteration.
• GENERIC STACK using Resizing Array - A generic stack implementation, resizing array based with Iteration.
• Loading...

Week 3 - Merge Sort, Quick Sort

• Coming Soon

Week 4 - Priority Queues, Elementary Symbol Table

• Coming Soon

Week 5 - Balanced Search Tree

• Coming Soon

Week 6 - Hash Tables

• Coming Soon