Data Structures and Algorithms | Learn Data Structures and Algorithms

Contents

1 Rabin-Karp Algorithm
2 Backtracking Algorithm
3 Longest Common Subsequence
4 Floyd-Warshall Algorithm
5 Dynamic Programming
6 Huffman Coding
7 Prim’s Algorithm
8 Kruskal’s Algorithm
9 Dijkstra’s Algorithm
10 Ford-Fulkerson Algorithm
11 Greedy Algorithm
12 Binary Search
13 Linear Search
14 Shell Sort Algorithm
15 Heap Sort Algorithm
16 Bucket Sort Algorithm
17 Radix Sort Algorithm
18 Counting Sort Algorithm
19 Quicksort Algorithm
20 Merge Sort Algorithm
21 Insertion Sort Algorithm
22 Selection Sort Algorithm
23 Bubble Sort Algorithm
24 Bellman-Ford Algorithm
25 Breadth-first search
26 Depth First Search (DFS)
27 Adjacency List
28 Adjacency Matrix
29 Strongly Connected Components
30 Spanning Tree and Minimum Spanning Tree
31 Graph Data Structure
32 Red-Black Tree Deletion
33 Red-Black Tree Insertion
34 Red-Black Tree
35 B+ Tree Deletion
36 B+ Tree Insertion
37 B+ Tree
38 B-tree Deletion
39 B-tree Insertion
40 B-tree
41 AVL Tree
42 Binary Search Tree (BST)
43 Balanced Binary Tree
44 Complete Binary Tree
45 Perfect Binary Tree
46 Full Binary Tree
47 Binary Tree
48 Tree Traversal – inorder, preorder and postorder
49 Tree Data Structure
50 Decrease Key and Delete Node Operations on a Fibonacci Heap
51 Fibonacci Heap
52 Heap Data Structure
53 Hash Table
54 Types of Linked List – Singly-linked, doubly linked, and circular
55 Linked List Operations: Traverse, Insert and Delete
56 LinkedList Data Structure
57 Deque Data Structure
58 Priority Queue
59 Circular Queue Data Structure
60 Types of Queues
61 Queue Data Structure
62 Stack Data Structure
63 Divide and Conquer Algorithm
64 Master Theorem
65 Asymptotic Analysis: Big-O Notation and More
66 Why Learn Data Structures and Algorithms?
67 What is an Algorithm?

Rabin-Karp Algorithm

In this tutorial, you will learn what the rabin-karp algorithm is. Additionally, you will discover working instances of the rabin-karp ...
Read More

Backtracking Algorithm

In this tutorial, you will learn what a backtracking algorithm is. Likewise, you will discover an illustration of a backtracking ...
Read More

Longest Common Subsequence

In this tutorial, you will learn how the longest common subsequence is found. Additionally, you will discover working instances of ...
Read More

Floyd-Warshall Algorithm

In this tutorial, you will learn how the floyd-warshall algorithm works. Additionally, you will discover working instances of the Floyd-warshall ...
Read More

Dynamic Programming

In this tutorial, you will learn what dynamic programming is. Likewise, you will discover the comparison between dynamic programming and ...
Read More

Huffman Coding

In this tutorial, you will learn how Huffman Coding works. Additionally, you will discover working instances of Huffman Coding in ...
Read More

Prim’s Algorithm

In this tutorial, you will learn Prim's Algorithm works. Additionally, you will discover working instances of Prim's Algorithm in C, ...
Read More

Kruskal’s Algorithm

In this tutorial, you will learn how Kruskal's Algorithm works. Likewise, you will discover working instances of Kruskal's Algorithm in ...
Read More

Dijkstra’s Algorithm

Dijkstra's algorithm allows us to find the briefest way between any two vertices of a graph. It differs from the ...
Read More

Ford-Fulkerson Algorithm

In this tutorial, you will learn what the Ford-Fulkerson algorithm is. Likewise, you will discover working instances of discovering maximum ...
Read More

Greedy Algorithm

In this tutorial, you will learn what a Greedy Algorithm is. Additionally, you will discover an illustration of a greedy ...
Read More

Binary Search

In this tutorial, you will learn how the Binary Search sort works. Likewise, you will discover working instances of Binary ...
Read More

Linear Search

In this tutorial, you will learn about the linear search. Likewise, you will discover working instances of linearsearch C, C++, ...
Read More

Shell Sort Algorithm

In this tutorial, you will learn how shell sort works. Likewise, you will discover working instances of shell sort in ...
Read More

Heap Sort Algorithm

In this tutorial, you will learn how the heap sort algorithm works. Additionally, you will discover working instances of heap ...
Read More

Bucket Sort Algorithm

In this tutorial, you will learn how bucket sort works. Likewise, you will discover working instances of bucket sort in ...
Read More

Radix Sort Algorithm

In this tutorial, you will learn how radix sort works. Additionally, you will discover working instances of radix sort in ...
Read More

Counting Sort Algorithm

In this tutorial, you will learn how count sort works. Additionally, you will discover working instances of counting sort in ...
Read More

Quicksort Algorithm

In this tutorial, you will learn how quicksort works. Additionally, you will discover working instances of quicksort in C, C++ ...
Read More

Merge Sort Algorithm

In this tutorial, you will learn about merge sort. Likewise, you will discover working instances of merge sort C, C++, ...
Read More

Insertion Sort Algorithm

In this tutorial, you will learn how insertion sort functions. Likewise, you will discover working instances of insertions sort in ...
Read More

Selection Sort Algorithm

In this tutorial, you will learn how selection sort works. Additionally, you will discover working instances of selection sort in ...
Read More

Bubble Sort Algorithm

In this tutorial, you will learn how bubble sort works. Additionally, you will discover working instances of bubble sort in ...
Read More

Bellman-Ford Algorithm

The bellman-Ford algorithm helps us locate the briefest way from a vertex to any remaining vertices of a weighted graph ...
Read More

Breadth-first search

In this tutorial, you will learn about the breadth-first search algorithm. Additionally, you will discover working instances of bfs algorithm ...
Read More

Depth First Search (DFS)

In this tutorial, you will learn about depth-first search algorithms with examples and pseudocode. Additionally, you will learn how to ...
Read More

Adjacency List

In this tutorial, you will learn what an adjacency list is. Additionally, you will discover working instances of adjacency list ...
Read More

Adjacency Matrix

In this tutorial, you will learn what an adjacency matrix is. Likewise, you will discover working instances of adjacency matrix ...
Read More

Strongly Connected Components

In this tutorial, you will learn how strongly connected components are formed. Additionally, you will discover working instances of kosararju's ...
Read More