Tutorial Category: Algorithm

Bubble Sort

Bubble sort is one of the simplest sorting algorithms. To sort an array using bubble sort,  we will compare every two elements of the array, If these two are...

Selection Sort

Selection sort is one of the simple sorting algorithms with time complexity O(n2). How selection sort works In selection sort, first, we search for a minimum...

Counting Sort

Counting sort is different from other sorting algorithms like the bubble sort, selection sort, and mergesort. Those sorting algorithms are comparison based. In those...

Merge Sort

Merge sort is one of the popular sorting algorithms. The time complexity of this algorithm is O(nlogn). This algorithm is based on divide and conquer.  Divide...

Binary Search

Suppose we are given a sorted array (0-based indexing) a = {10, 32, 34, 40, 50, 100, 101, 102, 104}, and a number k=40. We have to find out the position of this...

Ternary Search

Let us have a function y=f(x)=3+x-x*x. We want to find x for which y is maximum Graph of y=3+x-x*x In this graph, we can see if you increase x first y is increasing...

Depth First Search - DFS

Depth first search in short form DFS is a graph traversal algorithm. The time complexity of DFS is O(V+E) where V is the number of vertex and E is the number of...

An algorithm is a set of instructions or a step-by-step procedure for solving a problem or accomplishing a specific task. It is a well-defined computational procedure that takes some input, performs a series of operations, and produces an output.

Algorithms are used in a wide range of fields, including computer science, mathematics, engineering, and more. They are often used to solve complex problems that require a systematic approach and can be used to perform tasks such as sorting, searching, and data analysis.

A good algorithm is efficient, accurate, and easy to understand. It should be designed to produce the correct output for any valid input and should be able to handle errors or unexpected situations gracefully. Algorithmic efficiency is also an important consideration, as it can have a significant impact on the performance of a system or application.

Some common examples of algorithms include:

Sorting algorithms, such as bubble sort, merge sort, and quicksort, arrange a collection of data in a particular order
Search algorithms, such as linear search and binary search, find specific data within a collection
Encryption algorithms, such as AES and RSA, encode data to keep it secure
Optimization algorithms, such as gradient descent, find the best solution to a problem within a set of constraints
Algorithms are a fundamental concept in computer science and are used extensively in programming and software development.