Bubble sort has an adaptive sort with the same time complexity as selection sort.
r/>
This clip is from the chapter "Sorting and Searching" of the series "From 0 to 1: Data Structures & Algorithms in Java".Learn about various...

Find the shortest path in a weighted graph where the number of edges also determine which path is shorter.<br/<br/>>

This clip is from the chapter "Graph Problems" of the series "From 0 to 1: Data Structures & Algorithms in Java".null

Let's see how we implement Prim's algorithm in Java.
r/>
This clip is from the chapter "Spanning Tree Algorithms" of the series "From 0 to 1: Data Structures & Algorithms in Java".Prim's algorithm is very similar to Dijkstra's...

Learn to implement the Bellman Ford Algorithm.
r/>
This clip is from the chapter "Shortest Path Algorithms" of the series "From 0 to 1: Data Structures & Algorithms in Java".In this section, we are introduced to unweighted...

This video introduces the components of the STL.<br/<br/>>

This clip is from the chapter "Standard Template Library" of the series "Complete Modern C++".This section is the description of the standard template library.

Let's see how to implement the circular queue.
r/>
This clip is from the chapter "Stacks And Queues" of the series "From 0 to 1: Data Structures & Algorithms in Java".In this section, we build stack function in Java, meet...

Given a course list and pre-reqs for every course design a course schedule so pre-reqs are done before the courses.
r/>
This clip is from the chapter "Graph Problems" of the series "From 0 to 1: Data Structures & Algorithms in...

The implementation of Dijkstra's algorithm in Java.
r/>
This clip is from the chapter "Shortest Path Algorithms" of the series "From 0 to 1: Data Structures & Algorithms in Java".In this section, we are introduced to unweighted...

Graphs whose edges have a weight associated are widely used to model real world problems (traffic, length of path etc).
r/>
This clip is from the chapter "Shortest Path Algorithms" of the series "From 0 to 1: Data Structures &...

Shortest path implementation in Java.
r/>
This clip is from the chapter "Shortest Path Algorithms" of the series "From 0 to 1: Data Structures & Algorithms in Java".In this section, we are introduced to unweighted graph. We...

Here is the code in Java to implement topological sort.
r/>
This clip is from the chapter "Graph Algorithms" of the series "From 0 to 1: Data Structures & Algorithms in Java".Topological sort is an ordering of vertices in a...

Learn about adjacency list and the adjacency set which are alternate ways to represent a graph.
r/>
This clip is from the chapter "Graphs" of the series "From 0 to 1: Data Structures & Algorithms in Java".The author introduces...

The graph vertices are rows and columns of the matrix and the cell value shows the relationship between the vertices of a graph.
r/>
This clip is from the chapter "Graphs" of the series "From 0 to 1: Data Structures &...

Phase II actually outputs the final sorted array. It involves removing the elements from the heap and placing it in a sorted array.
r/>
This clip is from the chapter "Revisiting Sorting - The Heap Sort" of the series "From 0 to...

Learn to add and remove elements from a heap.
r/>
This clip is from the chapter "Heaps" of the series "From 0 to 1: Data Structures & Algorithms in Java".In this section, we learn about Heap data structure, build a real heap in...

The Binary Heap is logically a Binary Tree with specific constraints. The heap property and the shape property determine whether a Binary Tree is really a Heap.
r/>
This clip is from the chapter "Heaps" of the series "From 0 to...

Learn more about common operations on a Priority Queue are insertion, accessing the highest priority element and removing the highest priority element.
r/>
This clip is from the chapter "Heaps" of the series "From 0 to 1: Data...

This video will make things easy to follow. Topological sort is widely used in real world problems.
r/>
This clip is from the chapter "Graph Algorithms" of the series "From 0 to 1: Data Structures & Algorithms in...

Depth first traversal can be of 3 types based on the order in which the node is processed relative to it's left and right sub-trees.
r/>
This clip is from the chapter "Binary Trees" of the series "From 0 to 1: Data Structures &...

Learn more about queues which are much more intuitive as there are plenty of real world examples where a queue is the fair and correct way of processing.
r/>
This clip is from the chapter "Stacks And Queues" of the series "From...

Common traversal methods of trees apply to graphs as well. There is an additional wrinkle with graphs, dealing with cycles and with unconnected graphs.
r/>
This clip is from the chapter "Graphs" of the series "From 0 to 1: Data...

Let's visualize breadth first traversal and see how it's implemented.
r/>
This clip is from the chapter "Binary Trees" of the series "From 0 to 1: Data Structures & Algorithms in Java".In this section, we study more about...

Let's see what makes quick sort so attractive.
r/>
This clip is from the chapter "Sorting and Searching" of the series "From 0 to 1: Data Structures & Algorithms in Java".Learn about various sorting and searching functions from...

Learn how you can make an informed choice between Linked lists and arrays which solve the same kind of problems, holding a list or a collection.
r/>
This clip is from the chapter "Linked Lists" of the series "From 0 to 1: Data...