Blog - Algorithms

Quick Sort: Understanding and Implementing in Python

Among the various sorting algorithms available, Quick Sort stands out as one of the efficient and widely used sorting algorithms. Although, it can offer a worst case time complexity as O(n^2) but it offers a best and an average-case time complexity of O(n log n) and...

Heap Sort : An Explanation and Implementation

by Vishwamitra Mishra | Difficult, Sorting

In the series of sorting algorithms, this is the 4th sorting algorithm which is quite popular because of its better time complexity. From the name of this sorting algorithm, you can already guess that this sorting method is based on the Heap data structure. It was...

Hangman Game in Python – A Step-by-Step Guide

by Vishwamitra Mishra | Easy

Have you ever played the hangman game before? It's a classic word-guessing game that's been around for decades. In this blog post, we'll show you how to implement the hangman game in Python. We'll go through the code and explain everything in detail, so even if you're...

Insertion Sort : An Explanation and Implementation

by Vishwamitra Mishra | Easy, Sorting

Insertion Sort is a simple, yet powerful algorithm for sorting data. The algorithm works by taking one element at a time from an unsorted list and inserting it into a sorted list in the correct position. In this article, we will learn how the Insertion Sort algorithm...

What is Bubble Sort and its implementation in Python

by Vishwamitra Mishra | Easy, Sorting

In the world of sorting algorithms, Bubble Sort is a classic algorithm. While it may not be the most efficient way to sort large datasets, it is easy to understand and implement. In this article, we'll explore how to implement Bubble Sort in Python, and we'll provide...

Dijkstra’s shortest path algorithm

by Vishwamitra Mishra | Medium

Dijkstra's shortest path algorithm is a widely used algorithm in computer science that finds the shortest path between nodes in a graph with non-negative edge weights. It was developed by Edsger W. Dijkstra in 1956 and has since become a fundamental algorithm in...

Merge Sort in Python: The Ultimate Guide

by Vishwamitra Mishra | Medium, Sorting

If you're a programmer or data scientist, you've probably heard of the merge sort algorithm. Merge sort is a popular and efficient sorting algorithm widely used in computer science. In this guide, we'll explore what merge sort is, how it works, and how to implement it...

HEAP Data Structure – A Complete Guide [Python Code]

by Vishwamitra Mishra | Difficult

An introduction to Heap In computer science, a heap is a tree-based data structure that is commonly used to implement priority queues. The heap is a type of binary tree i.e. each parent node can have only two children (left and right). All levels of the tree are...

Welcome to the World of Algorithms in Python

by Vishwamitra Mishra | Easy

Welcome to the World of Algorithms in Python Are you interested in learning about different types of algorithms and how they can be implemented in Python? Are you preparing for technical interviews with companies like Google, Facebook, Amazon, and other top tech...

Two Number sum from an Array of Integers

by Vishwamitra Mishra | Easy

An Introduction This is a very common algorithm question. Although it sounds very easy at first while writing the code for such problems might trick you a little bit. This problem is commonly used in technical interviews and is a great way to demonstrate a...

Welcome to the Algo-World

Are you interested in learning about different types of algorithms and how they can be implemented in Python? Are you preparing for technical interviews with companies like Google, Facebook, Amazon, and other top tech companies? Then you’ve come to the right place! Welcome to our new blog on algorithms in Python.

Know more