def _do_sort(self, data: data_store) -> None: for i in range(data.size()): min_index = i for j in range(i + 1, data.size()): if data.is_greater_than(min_index, j): min_index = j if not i == min_index: data.swap(min_index, i)
def _do_sort(self, data: data_store) -> None: sorted = False while not sorted: sorted = True for i in range(data.size() - 1): if data.is_greater_than(i, i + 1): data.swap(i, i + 1, skip_draw=True) sorted = False data.draw()
def __find_max(self, data: data_store, size: int) -> int: max_index = 0 for i in range(0, size): if data.is_greater_than(i, max_index): max_index = i return max_index