Two-dimensional array(Marix) – A two-dimensional array is a list of finite numbers m*n homogeneous data elements such that the element of the array is referenced by two index sets consisting of m and n consecutive integer numbers. the elements of the array are stored in consecutive The size of two – a dimensional array is […]
HEAP SORTING: – In this method, a tree structure called a heap is used. A heap is a type of binary tree. An ordered balanced binary tree is called a min heap where the value at the root of any sub-tree is less than or equal to the value of either of its children. An […]
QUICK SORTING: – Quick Sort is an algorithm that also likes to merge sort and uses the idea of divide and conquers. This algorithm finds the element that divides (splits) the array into halves in such a way that the elements in the left sub-array are less than and the elements in the right sub […]
RADIX SORTING:– A radix sort also called Bucket sort is the method used by most people when sorting a list of namesphabetic order. The procedure we follow: (a) First the names are grouped according to the first letter, thus the names are arranged in 26 classes, one for each letter of the alphabet. The first […]
MERGE SORTING: – Merging means combining two sorted lists into one sorted list. For this, the elements from both the sorted lists are compared. The smaller of both the elements are then stored in the third array Merge Sort is a sorting algorithm that uses the idea of divide and conquers This algorithm divides the […]