• Thumbnail for Bubble sort
    Bubble sort (redirect from Bubblesort)
    pseudocode the algorithm can be expressed as (0-based array): procedure bubbleSort(A : list of sortable items) n := length(A) repeat swapped := false for...
    19 KB (2,357 words) - 13:37, 18 December 2024
  • sorting algorithm, such as bubblesort, to sort its inputs and return the sorted list. That is to say, badsort(L, 0) = bubblesort(L). Therefore, badsort's...
    15 KB (1,888 words) - 19:09, 18 December 2024
  • Insertion Sort Quick Sort Heap Sort Radix Sort Selection sort Consider a Bubblesort, where adjacent records are swapped in order to get them into the right...
    2 KB (305 words) - 10:24, 3 December 2022
  • Thumbnail for Sorting algorithm
    {\displaystyle n^{2}} n 2 {\displaystyle n^{2}} 1 Yes Exchanging A variant of Bubblesort which deals well with small values at end of list Gnome sort n n 2 {\displaystyle...
    68 KB (6,410 words) - 00:31, 11 January 2025
  • Thumbnail for PureBasic
    although SortArray is now a built-in function of PureBasic. Procedure bubbleSort(Array a(1)) Protected i, itemCount, hasChanged itemCount = ArraySize(a())...
    14 KB (1,177 words) - 22:52, 9 January 2025
  • TXL is a special-purpose programming language originally designed by Charles Halpern-Hamu and James Cordy at the University of Toronto in 1985. The acronym...
    4 KB (461 words) - 01:13, 24 July 2022
  • Thumbnail for Odd–even sort
    processors with long-range connections. The single-processor algorithm, like bubblesort, is simple but not very efficient. Here a zero-based index is assumed:...
    8 KB (1,039 words) - 16:00, 21 December 2023
  • Thumbnail for Horizons: Software Starter Pack
    a Breakout clone which, while basic, was described as very addictive. Bubblesort is an implementation of the bubble sort sorting algorithm. Evolution is...
    4 KB (387 words) - 10:57, 22 December 2023
  • {\displaystyle \{0,1\}} . This can be fixed by flipping k manually. Program bubblesort declare n: integer, A: array [0..n-1] of integer initially n = 20 # <||...
    4 KB (672 words) - 03:09, 29 December 2023
  • path : [ {"-":[{"-" : [l ,i]},1]}] } } } - set : {i : {-:[i,1]}} - z Bubblesort input: {"type": "array", "items": "double"} output: {"type": "array",...
    6 KB (580 words) - 01:30, 2 December 2024