#algorithms

Read more stories on Hashnode

Articles with this tag

Hashing is a process used in computer science to convert input (like a string, number, or any other type of data) into a fixed-size string of bytes....

Linear search, also known as sequential search, is a method for finding a particular value in a list. It sequentially checks each element of the list...

Binary search is an efficient algorithm for finding a specific element in a sorted array or list. The key principle behind binary search is to divide...

Merge sort is a popular sorting algorithm that uses the divide-and-conquer approach. It divides the input array into two halves, sorts each half, and...

Quick Sort is a highly efficient sorting algorithm that is based on the divide and conquer principle. It can sort large datasets significantly faster...

Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. It is much less efficient on large lists...