Introduction to Data Structures & Algorithms in Java full

1. 06 Recursion/006 Merge Sort.mp417.23KB
2. 02 Analysis of Algorithms/008 Comparison of running times.mp432.65KB
3. 05 Stacks and Queues/002 Abstract Data Types.mp41.06MB
4. 10 Hashtables/009 Conclusion.mp41.32MB
5. 01 Introduction to Algorithms/Done/001 Introduction.mp41.72MB
6. 07 Binary Search Trees/014 Tree Traversal Post Order.mp42.17MB
7. 04 Linked Lists/002 Implementing a Linked List in Java.mp42.21MB
8. 08 More Sorting Algorithms/001 Introduction.mp42.3MB
9. 05 Stacks and Queues/006 Double Ended Queues.mp42.85MB
10. 10 Hashtables/003 Hashing.mp42.87MB
11. 03 Basic Sorting and Search Algorithms/006 On sorting algorithms - Comparison.mp43.11MB
12. 01 Introduction to Algorithms/Done/005 Correctness of an algorithm.mp43.13MB
13. 09 Heaps/002 Deleting the root.mp43.33MB
14. 09 Heaps/003 Inserting an item in a heap.mp43.5MB
15. 07 Binary Search Trees/016 Height of a Binary Tree.mp43.52MB
16. 03 Basic Sorting and Search Algorithms/011 Inserting and Deleting items in an ORDERED array.mp43.58MB
17. 03 Basic Sorting and Search Algorithms/012 Sorting any type of object.mp43.62MB
18. 03 Basic Sorting and Search Algorithms/003 Introduction to Insertion Sort.mp43.64MB
19. 09 Heaps/005 Representing heaps using Arrays.mp43.67MB
20. 10 Hashtables/002 Direct Access Tables.mp43.73MB
21. 05 Stacks and Queues/004 Queues.mp43.78MB
22. 06 Recursion/003 Tail recursion.mp43.89MB
23. 07 Binary Search Trees/015 Unbalanced Trees Vs Balanced Trees.mp43.92MB
24. 08 More Sorting Algorithms/007 Radix Sort.mp43.95MB
25. 02 Analysis of Algorithms/DOne/003 The RAM model of computation.mp44.01MB
26. 07 Binary Search Trees/003 Binary Search Trees.mp44.1MB
27. 03 Basic Sorting and Search Algorithms/005 Insertion Sort Pseudocode.mp44.14MB
28. 03 Basic Sorting and Search Algorithms/002 Selection Sort Pseudocode.mp44.14MB
29. 08 More Sorting Algorithms/003 QuickSort The partition step.mp44.14MB
30. 07 Binary Search Trees/013 Tree Traversal Pre Order.mp44.17MB
31. 09 Heaps/004 Heaps as Priority Queues.mp44.52MB
32. 05 Stacks and Queues/001 Stacks.mp44.54MB
33. 09 Heaps/006 Heap Sort.mp44.64MB
34. 10 Hashtables/006 Open Addressing to resolve collisions.mp44.67MB
35. 07 Binary Search Trees/017 Time Complexity of Operations on Binary Search Trees.mp44.68MB
36. 02 Analysis of Algorithms/DOne/002 How to calculate the time complexity.mp44.78MB
37. 02 Analysis of Algorithms/005 Pseudo code Bubble sort algorithm.mp45.1MB
38. 02 Analysis of Algorithms/Need/004 Time complexity of Bubble sort algorithm.mp45.15MB
39. 08 More Sorting Algorithms/008 Bucket Sort.mp45.35MB
40. 07 Binary Search Trees/004 Finding an item in a Binary Search Tree.mp45.38MB
41. 03 Basic Sorting and Search Algorithms/004 Applying Insertion Sort algorithm to cue balls.mp45.39MB
42. 06 Recursion/009 Time Complexity of Merge Sort.mp45.42MB
43. 06 Recursion/002 Understanding Recursion.mp45.43MB
44. 07 Binary Search Trees/010 Deleting an Item - Soft Delete.mp45.6MB
45. 02 Analysis of Algorithms/006 The Big O notation.mp45.6MB
46. 10 Hashtables/001 Introduction.mp45.64MB
47. 10 Hashtables/007 Strategies for Open Addressing.mp45.66MB
48. 10 Hashtables/008 Time Complexity Open Addressing.mp45.68MB
49. 04 Linked Lists/004 Length of a Linked List.mp45.73MB
50. 04 Linked Lists/005 Deleting the head node.mp46.13MB
51. 02 Analysis of Algorithms/DOne/001 Introduction.mp46.18MB
52. 04 Linked Lists/001 What is a Linked List.mp46.33MB
53. 03 Basic Sorting and Search Algorithms/001 Selection Sort.mp46.45MB
54. 08 More Sorting Algorithms/005 Shell Sort Example.mp46.47MB
55. 03 Basic Sorting and Search Algorithms/008 Searching elements in an un ordered array.mp46.6MB
56. 05 Stacks and Queues/003 Implementing Stacks using Arrays.mp46.65MB
57. 07 Binary Search Trees/012 Tree Traversal In Order.mp46.65MB
58. 07 Binary Search Trees/005 Implementing the find method.mp46.71MB
59. 07 Binary Search Trees/001 The Tree Data structure.mp46.86MB
60. 02 Analysis of Algorithms/007 Using Big O notation Examples.mp46.95MB
61. 05 Stacks and Queues/007 Double Ended Queues using Arrays.mp46.98MB
62. 09 Heaps/001 Introduction.mp46.98MB
63. 06 Recursion/005 Tower of Hanoi - Implementation.mp47MB
64. 01 Introduction to Algorithms/Done/004 Why study data structures algorithms.mp47.22MB
65. 09 Heaps/007 Building a heap.mp47.52MB
66. 04 Linked Lists/006 Searching for an Item.mp47.66MB
67. 10 Hashtables/004 Resolving collisions through chaining.mp47.69MB
68. 01 Introduction to Algorithms/Need/003 Bubble Sort algorithm.mp47.84MB
69. 07 Binary Search Trees/011 Finding smallest largest values.mp47.96MB
70. 03 Basic Sorting and Search Algorithms/007 Stable Vs Unstable Sorts.mp47.99MB
71. 04 Linked Lists/007 Doubly Ended Lists.mp48.06MB
72. 04 Linked Lists/008 Inserting data in a sorted Linked List.mp48.07MB
73. 07 Binary Search Trees/008 Deleting an Item - Case 2.mp48.2MB
74. 08 More Sorting Algorithms/002 QuickSort.mp48.36MB
75. 06 Recursion/001 Introduction.mp48.95MB
76. 03 Basic Sorting and Search Algorithms/009 Searching elements in an ORDERED array.mp49.01MB
77. 08 More Sorting Algorithms/006 Counting Sort.mp49.12MB
78. 08 More Sorting Algorithms/004 Shell Sort.mp49.57MB
79. 05 Stacks and Queues/005 Queues using Arrays.mp49.6MB
80. 03 Basic Sorting and Search Algorithms/010 Searching elements in an ORDERED array - contd..mp49.7MB
81. 06 Recursion/008 Merge Step - Pseudocode.mp49.72MB
82. 07 Binary Search Trees/006 Inserting an item in a Binary Search Tree.mp49.73MB
83. 06 Recursion/007 Merge Sort - Pseudocode.mp49.92MB
84. 07 Binary Search Trees/002 Binary Trees.mp410.82MB
85. 10 Hashtables/005 The Hash function.mp410.9MB
86. 01 Introduction to Algorithms/Done/002 Euclids algorithm.mp410.97MB
87. 07 Binary Search Trees/009 Deleting an Item - Case 3.mp411.15MB
88. 04 Linked Lists/003 Inserting a new Node.mp411.63MB
89. 07 Binary Search Trees/007 Deleting an Item Case 1.mp413.63MB
90. 06 Recursion/004 Tower of Hanoi.mp416.69MB
91. 04 Linked Lists/009 Doubly Linked List.mp419.05MB
92. 04 Linked Lists/010 Insertion Sort revisited.mp420.64MB