Urgent Solution Required

I. Write an sorting algorithm that successively compares pairs of adjacent elements, exchanging them if they are out of order, and alternately passing through the list from the beginning to the end and then from the end to the beginning until no exchanges are needed. Show the steps used to sort the list 4, 6, 1, 5, 10, 2. Find it's time complexity where frequency of microprocessor is 2GHz and program size is 16MB