Domino Code Fragment
| Code Name* Sort - Bubble Sort Algorithm | Date* 10/28/2025 | Source (or email address if you prefer)* [email protected] IP address:.172.70.80.51 | |
| 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. | |