CP164 Lecture Notes - Lecture 3: G1 Phase, Radix Sort, If And Only If
Document Summary
__updated__ = 2017-08-25 from math import log from list_linked import list class sorts: Uses class attribute "swaps" to determine how many times elements are swapped by the class. Use: sorts. swaps = 0 swaps = 0 # tracks swaps performed. Sorts a linked list using the selection sort algorithm. # go through each node in the unsorted list and find the max value. # remove the max node from the list. Sorts. swaps += 1 if max_prev is none: unsorted = max_node. _next else: max_prev. _next = max_node. _next. # move the next max node to the front of the sorted list. max_node. _next = a. _front a. _front = max_node return. Sorts a linked list using the bubble sort algorithm. Contents of a are sorted. done = false last = none while not done: # if no elements have been swapped, then the list is sorted done = true.
