## Merge sort

Working of Merge sort Merge sort is one of the sorting algorithms, this follows Divide and Conquer rule to sort the given elements. In the merge sort, the unsorted array of size is divided into n subparts, these subparts are…

An algorithm is a step by step procedure for problem-solving. there are different types of algorithms you can learn with infographics and videos . some examples are sorting and arranging algorithms

Working of Merge sort Merge sort is one of the sorting algorithms, this follows Divide and Conquer rule to sort the given elements. In the merge sort, the unsorted array of size is divided into n subparts, these subparts are…

Working of Insertion sort Insertion sort is sorting mechanism which is best then both bubble sort and selection sort. The elements in the array are compared with the preceding elements. In insertion sort array zeroth element is declared to be…

Working of Selection sort In selection sort, the comparison will be between two numbers from the starting of an array. the lesser will be left and a greater number will be right in ascending order.swapping of numbers will be done between…

Working of Bubble sort In bubble sorting, the comparison between two numbers takes place.there will be a sequence in comparison of the array elements. for ascending order first and second elements will be compared if the first element is greater…

What is Sorting? arranging elements in a sequential manner is called sorting.there are three important reasons behind sorting of an elements Time Complexity Space Complexity The efficiency of Linear Search Time Complexity The Number of machine instructions, which a program…