1. Introduction to Algorithms

  1. Introduction.vtt

  2. Euclid's algorithm.vtt

  3. Bubble Sort algorithm.mp4

  4. Why study data structures & algorithms.mp4

  5. Correctness of an algorithm.mp4

  6. Chapter Quiz.html

 10. Hashtables

  1. Introduction.vtt

  10.1 Hash Table.java

  11. Conclusion.vtt

  2. Direct Access Tables.mp4

  3. Hashing.mp4

  4. Resolving collisions through chaining.mp4

  5. The Hash function.mp4

  6. Open Addressing to resolve collisions.mp4

  7. Strategies for Open Addressing.mp4

  8. Time Complexity Open Addressing.mp4

  9. Chapter Quiz.html

 2. Analysis of Algorithms

  10. Chapter Quiz.html

  2. Introduction.vtt

  3. How to calculate the time complexity.vtt

  4. The RAM model of computation.vtt

  5. Time complexity of Bubble sort algorithm.vtt

  6. Pseudo code Bubble sort algorithm.vtt

  7. The Big O notation.mp4

  8. Using Big O notation Examples.mp4

  9. Comparison of running times.mp4

 3. Basic Sorting and Search Algorithms

  1. Selection Sort.vtt

  10. Searching elements in an ORDERED array.vtt

  11. Searching elements in an ORDERED array - contd..vtt

  12. Inserting and Deleting items in an ORDERED array.vtt

  12.2 Ordered Array.java

  13. Sorting any type of object.vtt

  13.2 Circle.java

  15. Assignment.html

  2. Selection Sort Pseudocode.mp4

  2.1 Selection Sorter.java

  3. Introduction to Insertion Sort.mp4

  4. Applying Insertion Sort algorithm to cue balls.mp4

  5. Insertion Sort Pseudocode.mp4

  5.1 Insertion Sorter.java

  6. O(n²) sorting algorithms - Comparison.vtt

  8. Stable Vs Unstable Sorts.mp4

  9. Searching elements in an un ordered array.mp4

 4. Linked Lists

  1. What is a Linked List.vtt

  10. Doubly Linked List.vtt

  11. Insertion Sort revisited.vtt

  13. Assignment.html

  13.2 Chapter4 Code.zip

  2. Implementing a Linked List in Java.vtt

  3. Inserting a new Node.vtt

  4. Length of a Linked List.vtt

  5. Deleting the head node.vtt

  6. Searching for an Item.vtt

  7.1 Linked List.java

  7.3 Linked List Demo.java

  8. Doubly Ended Lists.mp4

  9. Inserting data in a sorted Linked List.mp4

 5. Stacks and Queues

  1. Stacks.vtt

  2. Abstract Data Types.vtt

  3. Implementing Stacks using Arrays.vtt

  4. Queues.vtt

  5. Queues using Arrays.vtt

  6. Double Ended Queues.vtt

  7. Double Ended Queues using Arrays.vtt

  9. Assignment.html

  9.2 Chapter5 Code.zip

 6. Recursion

  1. Introduction.vtt

  11. Assignment.html

  11.2 Chapter6 Code.zip

  2. Understanding Recursion.vtt

  3. Tail recursion.vtt

  4. Tower of Hanoi.vtt

  5. Tower of Hanoi - Implementation.vtt

  6. Merge Sort.vtt

  7. Merge Sort - Pseudocode.vtt

  8. Merge Step - Pseudocode.vtt

  9. Time Complexity of Merge Sort.vtt

 7. Binary Search Trees

  1. The Tree Data structure.vtt

  10. Deleting an Item - Soft Delete.vtt

  11. Finding smallest & largest values.vtt

  12. Tree Traversal In Order.vtt

  13. Tree Traversal Pre Order.vtt

  14. Tree Traversal Post Order.vtt

  15. Unbalanced Trees Vs Balanced Trees.vtt

  16. Height of a Binary Tree.vtt

  17. Time Complexity of Operations on Binary Search Trees.vtt

  19. Assignment.html

  19.2 Assignment 7.java

  2. Binary Trees.vtt

  3. Binary Search Trees.vtt

  4. Finding an item in a Binary Search Tree.vtt

  5. Implementing the find method.vtt

  6. Inserting an item in a Binary Search Tree.vtt

  7. Deleting an Item Case 1.vtt

  8. Deleting an Item - Case 2.vtt

  9. Deleting an Item - Case 3.vtt

 8. More Sorting Algorithms

  1. Introduction.vtt

  10.1 Chapter8 Code.zip

  2. QuickSort.vtt

  3. QuickSort The partition step.vtt

  4. Shell Sort.vtt

  5. Shell Sort Example.vtt

  6. Counting Sort.vtt

  7. Radix Sort.vtt

  8. Bucket Sort.vtt

 9. Heaps

  1. Introduction.vtt

  2. Deleting the root.vtt

  3. Inserting an item in a heap.vtt

  4. Heaps as Priority Queues.vtt

  5. Representing heaps using Arrays.vtt

  6. Heap Sort.vtt

  7. Building a heap.vtt

  9. Assignment.html