Difference between revisions of "Bubble sort"
From Lazarus wiki
Jump to navigationJump to search (rename section →Features: to →Characteristics: as “slow”/etc. is usually not a selling point) |
|||
| (3 intermediate revisions by one other user not shown) | |||
| Line 1: | Line 1: | ||
| + | {{Bubble sort}} | ||
| − | Bubble sort is a simple sorting algorithm. | + | Bubble sort is a simple [[sorting algorithm]]. |
| − | == | + | == Characteristics == |
* Very slow | * Very slow | ||
| Line 10: | Line 11: | ||
== Unit UBubbleSort == | == Unit UBubbleSort == | ||
| − | <syntaxhighlight> | + | <syntaxhighlight lang="pascal"> |
unit UBubbleSort; | unit UBubbleSort; | ||
| Line 58: | Line 59: | ||
== Example of usage == | == Example of usage == | ||
| − | <syntaxhighlight> | + | <syntaxhighlight lang="pascal"> |
uses | uses | ||
UBubbleSort | UBubbleSort | ||
| Line 73: | Line 74: | ||
== See also == | == See also == | ||
* [https://www.youtube.com/watch?v=DXO-nqATduU| COMP1 Revise & Learn : Bubble Sort] | * [https://www.youtube.com/watch?v=DXO-nqATduU| COMP1 Revise & Learn : Bubble Sort] | ||
| − | |||
| − | |||
| − | |||
| − | |||
Latest revision as of 21:47, 27 January 2021
│
English (en) │
suomi (fi) │
français (fr) │
Bubble sort is a simple sorting algorithm.
Characteristics
- Very slow
- Suitable only for small quantities sorting
- Fast only when the array is nearly sorted
Unit UBubbleSort
unit UBubbleSort;
interface
type
// data type
TItemBubbleSort=integer;
procedure BubbleSort( var a: array of TItemBubbleSort );
implementation
procedure swap( var a, b:TItemBubbleSort );
var
temp : TItemBubbleSort;
begin
temp := a;
a := b;
b := temp;
end;
procedure BubbleSort( var a: array of TItemBubbleSort );
var
n, newn, i:integer;
begin
n := high( a );
repeat
newn := 0;
for i := 1 to n do
begin
if a[ i - 1 ] > a[ i ] then
begin
swap( a[ i - 1 ], a[ i ]);
newn := i ;
end;
end ;
n := newn;
until n = 0;
end;
end.
Example of usage
uses
UBubbleSort
...
var
a: array[0..100] of integer;
begin
...
BubbleSort(a);
...
