1. Урок 1.00:03:43
    Introduction to the Course
  2. Урок 2.00:05:16
    JDK8 for Windows
  3. Урок 3.00:02:45
    JDK8 for MAC
  4. Урок 4.00:04:21
    JDK8 for Linux
  5. Урок 5.00:09:55
    IntelliJ for Windows
  6. Урок 6.00:09:44
    IntelliJ for MAC
  7. Урок 7.00:10:23
    IntelliJ for Linux
  8. Урок 8.00:02:54
    Introduction to Data Structures
  9. Урок 9.00:04:16
    Introduction to Algorithms
  10. Урок 10.00:00:54
    Introduction to Arrays
  11. Урок 11.00:14:10
    Big-O Notation
  12. Урок 12.00:07:43
    A Quick Review of Arrays in Java
  13. Урок 13.00:09:03
    Arrays in Memory
  14. Урок 14.00:11:57
    Big-O Values for Array Operations
  15. Урок 15.00:01:04
    Introduction to Sort Algorithms
  16. Урок 16.00:08:51
    Bubble Sort (Theory)
  17. Урок 17.00:11:35
    Bubble Sort (Implementation)
  18. Урок 18.00:04:43
    Stable vs. Unstable Sort Algorithms
  19. Урок 19.00:06:34
    Selection Sort (Theory)
  20. Урок 20.00:05:03
    Selection Sort (Implementation)
  21. Урок 21.00:07:35
    Insertion Sort (Theory)
  22. Урок 22.00:07:13
    Insertion Sort (Implementation)
  23. Урок 23.00:12:55
    Shell Sort (Theory)
  24. Урок 24.00:10:50
    Shell Sort (Implementation)
  25. Урок 25.00:18:11
    Recursion
  26. Урок 26.00:20:41
    Merge Sort (Theory)
  27. Урок 27.00:28:10
    Merge Sort (Implementation)
  28. Урок 28.00:08:59
    Quick Sort (Theory)
  29. Урок 29.00:12:35
    Quick Sort (Implementation)
  30. Урок 30.00:07:57
    Counting Sort (Theory)
  31. Урок 31.00:08:36
    Counting Sort (Implementation)
  32. Урок 32.00:11:13
    Radix Sort (Theory)
  33. Урок 33.00:13:19
    Stable Counting Sort (Theory)
  34. Урок 34.00:14:06
    Radix Sort (Implementation)
  35. Урок 35.00:07:01
    Sorting Arrays Using the JDK
  36. Урок 36.00:01:12
    Sort Algorithms Challenge #1
  37. Урок 37.00:04:04
    Sort Algorithms Challenge #1 Solution
  38. Урок 38.00:00:50
    Sort Algorithms Challenge #2
  39. Урок 39.00:11:47
    Sort Algorithms Challenge #2 Solution
  40. Урок 40.00:01:13
    Sort Algorithms Challenge #3
  41. Урок 41.00:09:50
    Sort Algorithms Challenge #3 Solution
  42. Урок 42.00:02:50
    Introduction to Lists
  43. Урок 43.00:02:57
    Abstract Data Types
  44. Урок 44.00:23:57
    Array Lists
  45. Урок 45.00:06:49
    Vectors
  46. Урок 46.00:06:43
    Singly Linked Lists (Theory)
  47. Урок 47.00:17:40
    Singly Linked Lists (Implementation)
  48. Урок 48.00:09:35
    Doubly Linked Lists (Theory)
  49. Урок 49.00:21:48
    Doubly Linked Lists (Implementation)
  50. Урок 50.00:12:35
    The JDK LinkedList Class
  51. Урок 51.00:01:37
    Linked Lists Challenge #1
  52. Урок 52.00:09:30
    Linked Lists Challenge #1 Solution
  53. Урок 53.00:01:47
    Linked Lists Challenge #2
  54. Урок 54.00:07:32
    Linked Lists Challenge #2 Solution
  55. Урок 55.00:00:39
    Introduction to Stacks
  56. Урок 56.00:07:23
    Stacks (Theory)
  57. Урок 57.00:18:32
    Stacks Implementation (Array)
  58. Урок 58.00:12:00
    Stacks Implementation (Linked List)
  59. Урок 59.00:02:04
    Stacks Challenge
  60. Урок 60.00:08:26
    Stacks Challenge Solution
  61. Урок 61.00:00:27
    Introduction to Queues
  62. Урок 62.00:03:39
    Queues (Theory)
  63. Урок 63.00:15:50
    Queues (Array Implementation)
  64. Урок 64.00:14:22
    Circular Queue Implementation (Part One)
  65. Урок 65.00:20:32
    Circular Queue Implementation (Part Two)
  66. Урок 66.00:08:21
    Queues and the JDK
  67. Урок 67.00:01:59
    Queues Challenge
  68. Урок 68.00:08:53
    Queues Challenge Solution
  69. Урок 69.00:00:24
    Introduction to Hashtables
  70. Урок 70.00:08:26
    Hashtables (Theory)
  71. Урок 71.00:13:54
    Hashtables (Array Implementation)
  72. Урок 72.00:21:15
    Linear Probing
  73. Урок 73.00:09:40
    Linear Probing - Removing Items
  74. Урок 74.00:11:04
    Linear Probing - Rehashing
  75. Урок 75.00:21:25
    Chaining
  76. Урок 76.00:16:53
    Hashtables and the JDK
  77. Урок 77.00:06:36
    Bucket Sort (Theory)
  78. Урок 78.00:09:05
    Bucket Sort (Implementation)
  79. Урок 79.00:01:55
    Hashtables Challenge #1
  80. Урок 80.00:02:40
    Hashtables Challenge #1 Solution
  81. Урок 81.00:01:38
    Hashtables Challenge #2
  82. Урок 82.00:07:56
    Hashtables Challenge #2 Solution
  83. Урок 83.00:00:51
    Introduction to Search Algorithms
  84. Урок 84.00:03:52
    Linear Search Algorithm
  85. Урок 85.00:07:58
    Binary Search Algorithm
  86. Урок 86.00:13:13
    Binary Search (Implementation)
  87. Урок 87.00:00:56
    Introduction to Trees
  88. Урок 88.00:11:17
    Trees (Theory)
  89. Урок 89.00:14:18
    Binary Search Trees (Theory)
  90. Урок 90.00:10:51
    Binary Search Trees (Insertion)
  91. Урок 91.00:11:25
    Binary Search Trees (Traversal)
  92. Урок 92.00:10:29
    Binary Search Trees (Get, Min, Max)
  93. Урок 93.00:03:16
    Binary Search Trees (Delete Cases 1 and 2)
  94. Урок 94.00:09:12
    Binary Search Trees (Implement Cases 1 and 2)
  95. Урок 95.00:08:52
    Binary Search Trees (Delete Case 3)
  96. Урок 96.00:07:17
    Binary Seach Trees (Implement Case 3)
  97. Урок 97.00:03:45
    Trees and the JDK
  98. Урок 98.00:01:54
    Binary Search Trees Challenge #1
  99. Урок 99.00:02:50
    Binary Search Trees Challenge #1 Solution
  100. Урок 100.00:09:18
    Binary Search Trees Challenge #2
  101. Урок 101.00:00:30
    Introduction to Heaps
  102. Урок 102.00:07:51
    Heaps (Theory)
  103. Урок 103.00:07:55
    Storing Heaps as Arrays
  104. Урок 104.00:09:03
    Heaps (Insert)
  105. Урок 105.00:06:56
    Heaps (Delete Theory)
  106. Урок 106.00:20:07
    Heaps (Delete)
  107. Урок 107.00:05:20
    Heaps (Peek)
  108. Урок 108.00:12:01
    Priority Queues
  109. Урок 109.00:04:55
    Heapsort (Theory)
  110. Урок 110.00:07:17
    Heapsort (Implementation)
  111. Урок 111.00:02:52
    Sets
  112. Урок 112.00:01:25
    Course Wrap-Up
  113. Урок 113.00:00:49
    Bonus - Please Watch!