Sorting algorithms/Bubble sort: Difference between revisions

Sorting algorithms/Bubble sort (view source)

26 bytes removed , 12 years ago

→‎{{header|Scheme}}: The first function is not iterative. The two versions are actually equal.

Anonymous user

Revision as of 22:15, 9 September 2011 (view source) 84.215.72.60 (talk) (→‎{{header\|Scheme}}: Fix formatting, simplified, better variable names) ← Older edit		Revision as of 08:10, 10 September 2011 (view source) 84.215.72.60 (talk) (→‎{{header\|Scheme}}: The first function is not iterative. The two versions are actually equal.) Newer edit →
Line 2,329: (fix sort-step x)))</lang> This solution ~~iteratively~~recursively finds the fixed point of sort-step. A comparison function must be passed to bubblesort. Example usages: <lang scheme>(bubble-sort (list 1 3 5 9 8 6 4 2) >) (bubble-sort (string->list "Monkey") char<?)</lang> Here is athe ~~recursive~~same ~~bubble sort which sorts list 'l'~~function, using ~~the~~a ~~comparator~~different ~~'f'~~syntax: <lang scheme>(define (bsort l gt?)