Algorithms part 1 complete

This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations. Part I covers elementary data structures, sorting, and searching algorithms. Part II focuses on graph- and string-processing algorithms.
--------------------------------TIME STAMP
0:00 Course introduction
---------------------------------------------------Union-find ---------------------------------------------------------------------------------
9:22 Dynamic Connectivity
19:44 Quick Find
30:02 Quick Union
37:52 Quick Union Improvement
50:55 Union Find Applications
-------------------------------------------------------------------------------Analysis of Algorithms---------------------------------------
1:00:17 Analysis of Algorithms Introduction
1:08:31 Observations
1:18:36 Mathematical Models
1:31:24 Order of Growth Classifications
1:46:03 Theory of Algorithms
1:57:38 Memory
-----------------------------------------------Stacks and Queues --------------------------------------------------------------------
2:05:49 Stacks
2:22:13 Resizing Arrays
2:32:09 Queues
2:36:42 Generics
2:46:08 Iterators
2:53:24 Stack and Queue Applications
--------------------------------------------------------Elementary Sorts----------------------------------------------------------------
3:06:48 Sorting Introduction
3:21:36 Selection Sort
3:28:35 Insertion Sort
3:38:03 Shellsort
3:48:50 Shuffling
3:56:29 Convex Hull
-----------------------------------------------------------------------------------Merge Sorts-----------------------------------------
4:10:19 Mergesort
4:34:12 Bottom up Mergesort
4:37:32 Sorting Complexity
4:46:37 Comparators
4:53:20 Stability
---------------------------------------------------------------------------Quicksort---------------------------------------------------------
4:59:16 Quicksort
5:18:49 Selection
5:25:57 Duplicate keys
5:37:22 System Sorts
---------------------------------------------------------------------------------------------------Priority Queues-----------------------------
5:49:12 APIs and Elementary Implementation
6:02:04 Binary Heaps
6:25:40 Heapsort
6:40:09 Event Driven Simulation
------------------------------------------------------------------------------------Elementary Symbol Tables--------------------------
7:02:47 Symbol Table API
7:24:17 Elementary Implementations
7:33:20 Ordered Operations
7:39:46 Binary Search Trees
7:59:43 Ordered Operations in BSTs
8:10:14 Deletion in BSTs
---------------------------------------------------------------------Balanced Search Trees -----------------------------------------------
8:20:07 Search Trees
8:37:02 Red Black BSTs
9:12:32 B-Trees
----------------------------------------------------------------Geometric Application of BSTs-----------------------------------------
9:23:09 1d Range Search
9:32:01 Line Segment Intersection
9:38:38 Kd Trees
10:07:45 Interval Search Trees
10:21:32 Rectangle Intersection
------------------------------------------------------------------Hash Tables-------------------------------------------------------------
10:29:43 Hash Functions
10:47:46 Separate Chaining
10:55:14 Linear Probing
11:09:51 Hash Table Context
11:20:00 Symbol Table Application Sets
11:25:13 Symbol Table Application Dictionary Clients
11:30:52 Symbol Table Application Indexing Clients
11:38:44 Symbol Table Application Sparse Vectors

Recommended Book
▶▶ Algorithms By Robert Sedgewick https://amzn.to/3nDMt1m

-------------------------------------------------------------------------------------------------------------------------------------
If you realllly enjoy my content, you're welcome to support me and my channel with a small donation via PayPal

Link to PayPal donation https://www.paypal.me/nerdslesson

Algorithms part 2 (1/2) https://youtu.be/0qF7tPSQdCg
Algorithms part 2 (2/2) https://youtu.be/6TW3JSVEJQE