In this course, we are going to look at the basic data structures and how you can use them to implement the various fundamental sorting algorithms!

In This Tutorial we look at sets, we look at how they work and what problems they can solve

In This Tutorial we look at priority queues, we look at how they work and what problems they can solve

In This Tutorial we look at arrays, we look at how they work and what problems they can solve

In This Tutorial we look at Queues, we look at how they work and what problems they can solve

In This Tutorial we look at Graphs, we look at how they work and what problems they can solve

In This Tutorial we look at Stacks, we look at how they work and what problems they can solve

In This Tutorial we look at how you can implement the Quicksort Sorting Algorithm in Python

In This Tutorial we look at how you can implement the Selection Sorting Algorithm in Python

In This Tutorial we look at tries, we look at how they work and what problems they can solve

In This Tutorial we look at Hash Tables, we look at how they work and what problems they can solve

In This Tutorial we look at bit manipulation and how you can use this to optimize your programs.

In This Tutorial we look at memoization and how you can use it to effectively optimize your recursive algorithms performance

In This Tutorial we look at how you can implement the Insertion Sorting Algorithm in Python

In This Tutorial we look at how you can implement the Bubble Sorting Algorithm in Python