Fibonacci Search is another divide and conquer algorithm which is used to find an element in a given list. In this tutorial, we will see how it works, how it is different from binary search, and we will implement it in python. Pre-requisites There are two topics we need to understand first before moving onto […]

Sentinel Search is a searching algorithm for a list of items that are stored in a sequential manner. In this tutorial, we will study how the algorithm works, we will compare it to the linear search, and we will use the algorithm to see if it works. Pre-Requisite: Linear Search Before we move on to […]

A Double-Ended Queue is a data structure that is used to store a collection of items that are meant to be in a queue. It is an extension of the queue data structure with some additional features. Pre-Requisite: Queue A queue is a data structure that is used to store a collection of items in […]

A doubly circular linked list is a data structure that is utilized to store records in a list. It is fundamentally the same as linked lists but with a few additional highlights. In this tutorial, we’ll look at what a doubly circular linked list is, how to make one in Python, and what is its […]

Circular Linked Lists are data structures that are used to store lists. It is very similar to linked lists but with a few extra features. In this tutorial, we will discuss what a circular linked list is, we will implement it in python and see its output. Pre-Requisite: Understanding of Linked List We must first […]

In this article, we will learn more about Min Heap (known as heap queue in Python). We have already learned about Heap and its library functions (in heapq module) in python. We will now learn about min-heap and its implementation and then look at the Python code for implementing the heapify, heappush and heappop functions […]