sorting all the sorting algorithms in this use data structures of specific type to demonstrate sortinge bit integer is often used as its associated operations ( etcare clear in their behaviour the algorithms discussed can easily be translated into generic sorting algorithms within your respective language of choice bubble sort one of the most simple forms of sorting is that of comparing each item with every other item in some listhowever as the description may imply this form of sorting is not particularly effecient ( in it' most simple form bubble sort can be implemented as two loops algorithm bubblesort(list prelist postlist has been sorted into values of ascending order for to list count for to list count if list[ilist[ swap(list[ ]list[ ] end if end for end for return list end bubblesort merge sort merge sort is an algorithm that has fairly efficient space time complexity ( log nand is fairly trivial to implement the algorithm is based on splitting listinto two similar sized lists (lef tand rightand sorting each list and then merging the sorted lists back together notethe function mergeordered simply takes two ordered lists and makes them one