fqe.util.bubblesort

Bubble Sort algorithm to arrange a list so that the lowest value is

fqe.util.bubblesort(
    arr: List[Any]
) -> int

stored in 0 and the highest value is stored in len(arr)-1. It is included here in order to access the swap count.

Args
arr (list) - object to be sorted

Returns
arr (list) - sorted swap_count (int) - number of permutations to achieve the sort

Except as otherwise noted, the content of this page is licensed under the Creative Commons Attribution 4.0 License, and code samples are licensed under the Apache 2.0 License. For details, see the Google Developers Site Policies. Java is a registered trademark of Oracle and/or its affiliates.

Last updated 2021-10-18 UTC.

Args