Quick Sort
Description -> Based on divide and conquer strategy. -> This is in-place sorting algorithm. Steps for Quick Sort 1) Select any element from array as pivot. 2) Rearrange array element…
All Program Related To Algorithm
Program of Merge Sort
Description * Merge sort is a algorithm that uses the divide, conquer and combine algorithm. * Steps of merge sort 1) Partition the n-element array into two sub-arrays of n/2…
Insertion Sort
Description It inserts each element into its proper place in the final list. More efficient than selection sort and bubble sort. Process of Insertion Sort 1) loop from first element…
Bubble Sort
Description * Bubble sort repeatedly swap the adjacent elements if they are not sorted. * Largest element repeatedly move to highest index, if elements are sored in acscending order or…
Selection Sort
Description * In selection sort 1. In first iteration, find minimum element and swap with first position 2. In second iteration, find second minimum element and swap with second position…
Program to Search for an Element in an Array using Binary Search
Description For binary search, array must be sorted. First compare element with the middle element. If element matches with middle element, return mid index. If element is greater than the…
Program to Search for an Element in an Array
Description Let we have arr[] = {1, 5 , 8, 6 , 4} and 1)we have to find 8 then our output will be 'Element 8 is present at position…