Domino Code Fragment
Code Name* Sort - Bubble Sort Algorithm | Date* 04/28/2024 | Source (or email address if you prefer)* Rlatulippe@romac.com IP address:.18.226.251.68 | |
Description* Sorts an array of data using the Bubble Sort Algorithm | Type* LotusScript | Categories* (Misc) |
Implementation: | Required Client: | Server: |
Limitations: | Comments: In a worst case scenario the bubble sort has to do elements 2 /2 compares and almost as many swaps. If file is in reverse order then the ith bubble sort pass requires N - i comparisons and exchanges. Keep variable temp as variant thus either a text or number array can be sorted. |