## Python Data Structure and Algorithm Tutorial – Huffman Coding

Huffman Coding   In this tutorial, you will learn how Huffman Coding works. Also, you will find working examples of Huffman Coding in Python. Huffman Coding is a technique of compressing data to reduce its size without losing any of the details. It was first developed by David Huffman. Huffman Coding is generally useful to …

## Python Data Structure and Algorithm Tutorial – Prim’s Algorithm

Prim’s Algorithm   In this tutorial, you will learn how Prim’s Algorithm works. Also, you will find working examples of Prim’s Algorithm in Python. Prim’s algorithm is a minimum spanning tree algorithm that takes a graph as input and finds the subset of the edges of that graph which form a tree that includes every vertex has …

## Python Data Structure and Algorithm Tutorial – Kruskal’s Algorithm

Kruskal’s Algorithm   In this tutorial, you will learn how Kruskal’s Algorithmworks. Also, you will find working examples of Kruskal’s Algorithm in Python. Kruskal’s algorithm is a minimum spanning tree algorithm that takes a graph as input and finds the subset of the edges of that graph which form a tree that includes every vertex has the …

## Python Data Structure and Algorithm Tutorial – Dijkstra’s Algorithm

Dijkstra’s Algorithm   Dijkstra’s algorithm allows us to find the shortest path between any two vertices of a graph. It differs from the minimum spanning tree because the shortest distance between two vertices might not include all the vertices of the graph. How Dijkstra’s Algorithm works Dijkstra’s Algorithm works on the basis that any subpath B …

## Python Data Structure and Algorithm Tutorial – Ford-Fulkerson Algorithm

Ford-Fulkerson Algorithm   In this tutorial, you will learn what Ford-Fulkerson algorithm is. Also, you will find working examples of finding maximum flow in a flow network in Python. Ford-Fulkerson algorithm is a greedy approach for calculating the maximum possible flow in a network or a graph. A term, flow network, is used to describe a network of …

## Python Data Structure and Algorithm Tutorial – Greedy Algorithm

Greedy Algorithm   In this tutorial, you will learn what a Greedy Algorithm is. Also, you will find an example of a greedy approach. A greedy algorithm is an approach for solving a problem by selecting the best option available at the moment, without worrying about the future result it would bring. In other words, …

## Python Data Structure and Algorithm Tutorial – Binary Search

Binary Search   In this tutorial, you will learn how Binary Search sort works. Also, you will find working examples of Binary Search in Python. Binary Search is a searching algorithm for finding an element’s position in a sorted array. In this approach, the element is always searched in the middle of a portion of …

## Python Data Structure and Algorithm Tutorial – Linear Search

Linear Search   In this tutorial, you will learn about linear search. Also, you will find working examples of linear search in Python. Linear search is the simplest searching algorithm that searches for an element in a list in sequential order. We start at one end and check every element until the desired element is …

## Python Data Structure and Algorithm Tutorial – Shell Sort Algorithm

Shell Sort Algorithm   In this tutorial, you will learn how shell sort works. Also, you will find working examples of shell sort in Python. Shell sort is an algorithm that first sorts the elements far apart from each other and successively reduces the interval between the elements to be sorted. It is a generalized …

## Python Data Structure and Algorithm Tutorial – Heap Sort Algorithm

Heap Sort Algorithm   In this tutorial, you will learn how heap sort algorithm works. Also, you will find working examples of heap sort in Python. Heap Sort is a popular and efficient sorting algorithm in computer programming. Learning how to write the heap sort algorithm requires knowledge of two types of data structures – …

## Python Data Structure and Algorithm Tutorial – Bucket Sort Algorithm

Bucket Sort Algorithm   In this tutorial, you will learn how bucket sort works. Also, you will find working examples of bucket sort in Python. Bucket Sort is a sorting technique that sorts the elements by first dividing the elements into several groups called buckets. The elements inside each bucket are sorted using any of the suitable sorting …

## Python Data Structure and Algorithm Tutorial – Radix Sort Algorithm

Radix Sort Algorithm   In this tutorial, you will learn how radix sort works. Also, you will find working examples of radix sort in Python. Radix sort is a sorting technique that sorts the elements by first grouping the individual digits of the same place value. Then, sort the elements according to their increasing/decreasing order. Suppose, …