summary notes arranging objects in specified order is called sorting bubble sortinsertion sortselection sortquick sortheap sortradix sort are some of very common search algorithms the comparison starts with the first element (or at the last elementand continues sequentially till either we find match or the end of the list is encountered linear search makes as many comparisons as there are elements in the array even if the array is sorted (either in ascending or descending orderthe number of comparisons remains the same keywords bubble sorta sorting technique in which the largest element of the remaining list bubbles up to its proper ordering position in each pass through the list heap sorta sorting technique in which all the entries in the list are arranged to satisfy heap propertyand then top of the heap is removed and another entry is promoted to take its place repeatedly merge sorta sorting technique in which the given list is broken down into smaller lists repeatedly until the list become easy to sortthen the sorted lists are merged to obtain the final sorted list quick sorta sorting technique in which an array is sorted by picking some value in the array as key elementthen swapping the first element of the list with the key element so that the key comes in the first position the proper place of key in the list is found out repeatedly sortinga technique to arrange the elements of list in some pre-specified order self assessment choose the appropriate answers which one is not the method of internal sorting(aheap sort (bmerge sort (cquick sort (dbubble sort polyphase sort is (ainternal sort (bexternal sort (cboth of the above (dnone is sorting technique which sorts contiguous list of length with (nlog (ncomparisons and movement of entrieseven in the worst case (aheap sort (bmerge sort (cquick sort lovely professional university