selection algorithms one interesting set of algorithms related to finding elements in an unordered list of items is selection algorithms in doing sowe shall be answering questions that have to do with selecting the median of set of numbers and selecting the ith-smallest or -largest element in listamong other things in this we will cover the following topicsselection by sorting randomized selection deterministic selection selection by sorting items in list may undergo statistical enquiries such as finding the meanmedianand mode values finding the mean and mode values do not require the list to be ordered howeverto find the median in list of numbersthe list must first be ordered finding the median requires one to find the element in the middle position of the ordered list but what if we want to find the last-smallest item in the list or the first-smallest item in the listto find the ith-smallest number in an unordered list of itemsthe index of where that item occurs is important to obtain but because the elements have not been sortedit is difficult to know whether the element at index in list is really the first-smallest number pragmatic and obvious thing to do when dealing with unordered lists is to first sort the list once the list is sortedone is assured that the zeroth element in the list will house the first-smallest element in the list likewisethe last element in the list will house the lastsmallest element in the list