Finding the right data we need is an age-old problem before computers. As developers, we create many search algorithms to retrieve data efficiently.
Search algorithms can be divided into two broad categories: sequential and interval searches. Sequential searches check each element in a data structure. Interval searches check various
Searching, in the context of Computer Science, is the process of locating a particular element in the given list/array. If we pay close attention, we can find search algorithms everywhere.
Consider the process of logging into a website. Entered email and password are searched against the existing key-value
Searching is one of the most commonly performed tasks in the domain of Computer Science. Many algorithms and data structures exist to make searching more efficient.
In this article, we'll look at the idea behind Binary Search and how to implement it in JavaScript.
Binary Search is a very
Sorting refers to arranging items of a list in a specific order (numerical or alphabetic). Sorting is generally used in tandem with searching.
It is generally easier to search for an element (called the key) in a given list if the list is sorted, both visually and algorithmically.
There
In this tutorial, we'll be diving into the theory and implementation of Bucket Sort in Python.
Bucket Sort is a comparison-type algorithm which assigns elements of a list we want to sort in Buckets, or Bins. The contents of these buckets are then sorted, typically with another algorithm. After
In this article, we'll be diving into the idea behind and Python implementation of Binary Search.
Binary Search is an efficient search algorithm that works on sorted arrays. It's often used as one of the first examples of algorithms that run in logarithmic time (O(logn)) because of its
In this article, we will explain what the idea behind Insertion Sort is and implement it in JavaScript.
Insertion Sort is one of the simpler sorting algorithms. It's highly intuitive, stable, in-place, and of comparison-type.
A stable sorting algorithm is an algorithm in which two objects with equal keys
Selection Sort is one of the simpler and more intuitive sorting algorithms. It is an in-place, unstable, comparison algorithm.
This means that it transforms the input collection using no auxiliary data structures and that the input is overridden by the output (in-place algorithm).
Additionally, during its execution, it only
