sequences for in range( )pair point(screen, ,jlst append(pair lst sort( for in lstprint( when the code in sect is called it prints the points in order of their distance from the -axis as follows ( , ( , ( , ( , ( , ( , ( , ( , ( , ( , ( , ( , ( , ( , ( , ( , ( , ( , butjust how does this sort method work and what is its costin other wordswhat kind of sorting algorithm does python use and what is its computational complexitywe explore these questions in the next sections selection sort in the last section we learned that we can call method called sort on list to sort the items in the list in ascending order ascending order is determined by the less than operator as defined on the items so how does the sorting algorithm work one of the early sorting algorithms was called selection sort and it serves as good starting place to understand sorting algorithms howeverthis is not the sorting algorithm used by python we'll find out why soon the selection sort algorithm is pretty simple to describe the algorithm begins by finding the smallest value to place in the first position in the list it does this by doing linear search through the list and along the way remembering the index of the smallest item it finds the algorithm uses the guess and check pattern by first guessing that the smallest item is the first item in the list and then checking the subsequent items to see if it made an incorrect guess this part of the algorithm is the selection part the select function does this selection this copy belongs to 'acha