Quicksort sort Quicksort is a divide and conquer algorithm. Quicksort first divides a large array into two smaller sub-arrays: the low elements and the high elements. Quicksort can then recursively sort the sub-arrays. Quicksort steps: Pick an element, called a pivot, from the array. Partitioning: reorder the array so that all elements with values less … Read more

Insertion sort 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 than more advanced algorithms such as quicksort, heapsort, or merge sort. It iterates, take one input element each repetition, and growing a sorted output list. … Read more

Selection sort The algorithm divides the input list into two parts: the sublist of items already sorted, which is built up from left to right at the front (left) of the list, and the sublist of items remaining to be sorted that occupy the rest of the list. Initially, the sorted sublist is empty and … Read more

Bubble sort Bubble sort is a simple sorting algorithm that repeatedly steps through the list to be sorted, compares each pair of adjacent items and swaps them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted. The algorithm, … Read more

Sorting algorithm A sorting algorithm is a way to put elements of a list in a certain order. The most-used orders are numerical order and lexicographical order. Efficient sorting is important for optimizing the use of other algorithms (like search and merge algorithms) which require input data to be in sorted lists. It is also … Read more

Example package com.w3schools;   public class Test { public static int binarySearch(int[] data,int start, int end,int key){ if (start < end) { int mid = start + (end – start) / 2; if (key < data[mid]) { return binarySearch(data, start, mid, key);   } else if (key > data[mid]) { return binarySearch(data, mid+1, end , … Read more

Binary search Binary search is a search algorithm that finds the position of a target value within a sorted collection of data (we are taking array here). It is a fast search algorithm with run-time complexity of Ο(log n). It works on the principle of divide and conquer. Binary search compares the target value to … Read more

Example package com.w3schools;   public class Test { public static int recSearch(int data[], int l, int r, int key) { if (r < l) return -1; if (data[l] == key) return l; return recSearch(data, l+1, r, key); }   public static void main(String args[]){ int[] data= {50,27,30,50,70,9,19}; int key = 9;   int index = … Read more

Linear search Linear search is a way of finding a target value within a collection of data. It is also known as sequential search. It sequentially checks each element of the collection data for the target value until a match is found or until all the elements have been searched. Basic algorithm Given a collection … Read more

Search algorithm Search algorithm refers to a step-by-step procedure which is used to locate specific data among a collection of data. All search algorithms use a search key in order to proceed for the search operation. The efficiency of a search algorithm is measured by the number of times a comparison of the search key … Read more