Dive into a comprehensive 4-hour tutorial on data structures and algorithms using Java. Learn essential concepts starting with fundamental data structures like stacks, queues, and linked lists, then progress to dynamic arrays and compare linked lists with array lists. Explore crucial algorithmic concepts including Big O notation, various search and sort algorithms, recursion, and advanced data structures such as hash tables, graphs, and trees. Master techniques like depth-first and breadth-first search, and understand tree traversal. Conclude by learning how to calculate execution time, providing a solid foundation for efficient programming and problem-solving skills.
Overview
Syllabus
) What are data structures and algorithms? .
) Stacks .
) Queues ️.
) Priority Queues .
) Linked Lists .
) Dynamic Arrays .
) LinkedLists vs ArrayLists ♂️.
) Big O notation .
) Linear search ⬇️.
) Binary search .
) Interpolation search ❓.
) Bubble sort .
) Selection sort .
) Insertion sort .
) Recursion .
) Merge sort .
) Quick sort ⚡.
) Hash Tables #️⃣.
) Graphs intro .
) Adjacency matrix ⬜.
) Adjacency list .
) Depth First Search ⬇️.
) Breadth First Search ↔️.
) Tree data structure intro .
) Binary search tree .
) Tree traversal .
) Calculate execution time ⏱️.
Taught by
Bro Code
