figure bubble sort iterations algorithm mergesort(list prelist postlist has been sorted into values of ascending order if list count /already sorted return list end if list count lef list( right list(list count for to lef count- lef [ilist[ end for for to right count- right[ilist[ end for lef mergesort(lef right mergesort(right return mergeordered(lef tright end mergesort