Bubble sort/fr: what changed
Revision 2 to 3. Removed lines have a minus sign; added lines have a plus sign.
| Old | New | Line | |
|---|---|---|---|
| 1 | - | ||
| 2 | - | ||
| 3 | - | ||
| 4 | - | ||
| 5 | - | ||
| 6 | - | ||
| 7 | - | ||
| 8 | - | ||
| 1 | + | Le tri à bulle est un algorithme de tri simple. | |
| 9 | 2 | ||
| 10 | 3 | ## Propriétés | |
| 11 | 4 | ||
| 12 | - | ||
| 13 | - | ||
| 14 | - | ||
| 5 | + | - Très lent | |
| 6 | + | - Adapté seulement pour trier des données en petite quantité | |
| 7 | + | - Rapide seulement quand le tableau est presque trié | |
| 15 | 8 | ||
| 16 | 9 | ## Unité UBubbleSort | |
| 17 | - | ||
| 10 | + | ||
| 11 | + | ``` pascal | |
| 18 | 12 | unit UBubbleSort; | |
| 19 | - | ||
| 20 | - | ||
| 21 | - | ||
| 22 | - | ||
| 23 | - | ||
| 24 | - | ||
| 25 | - | ||
| 26 | - | ||
| 27 | - | ||
| 28 | - | ||
| 29 | - | ||
| 30 | - | ||
| 31 | - | ||
| 32 | - | ||
| 33 | - | ||
| 34 | - | ||
| 35 | - | ||
| 36 | - | ||
| 37 | - | ||
| 38 | - | ||
| 39 | - | ||
| 40 | - | ||
| 41 | - | ||
| 42 | - | ||
| 43 | - | ||
| 44 | - | ||
| 45 | - | ||
| 46 | - | ||
| 47 | - | ||
| 48 | - | ||
| 13 | + | ||
| 14 | + | interface | |
| 15 | + | ||
| 16 | + | type | |
| 17 | + | // data type | |
| 18 | + | TItemBubbleSort=integer; | |
| 19 | + | ||
| 20 | + | procedure BubbleSort( var a: array of TItemBubbleSort ); | |
| 21 | + | ||
| 22 | + | implementation | |
| 23 | + | ||
| 24 | + | procedure swap( var a, b:TItemBubbleSort ); | |
| 25 | + | var | |
| 26 | + | temp : TItemBubbleSort; | |
| 27 | + | begin | |
| 28 | + | temp := a; | |
| 29 | + | a := b; | |
| 30 | + | b := temp; | |
| 31 | + | end; | |
| 32 | + | ||
| 33 | + | procedure BubbleSort( var a: array of TItemBubbleSort ); | |
| 34 | + | var | |
| 35 | + | n, newn, i:integer; | |
| 36 | + | begin | |
| 37 | + | n := high( a ); | |
| 38 | + | repeat | |
| 39 | + | newn := 0; | |
| 40 | + | for i := 1 to n do | |
| 41 | + | begin | |
| 42 | + | if a[ i - 1 ] > a[ i ] then | |
| 49 | 43 | begin | |
| 50 | - | ||
| 51 | - | ||
| 52 | - | ||
| 53 | - | ||
| 54 | - | ||
| 55 | - | ||
| 56 | - | ||
| 57 | - | ||
| 58 | - | ||
| 59 | - | ||
| 60 | - | ||
| 44 | + | swap( a[ i - 1 ], a[ i ]); | |
| 45 | + | newn := i ; | |
| 46 | + | end; | |
| 47 | + | end ; | |
| 48 | + | n := newn; | |
| 49 | + | until n = 0; | |
| 50 | + | end; | |
| 51 | + | ||
| 52 | + | end. | |
| 61 | 53 | ``` | |
| 62 | 54 | ||
| 63 | 55 | ## Exemple d'emploi | |
| 64 | - | ||
| 56 | + | ||
| 57 | + | ``` pascal | |
| 65 | 58 | uses | |
| 66 | - | ||
| 67 | - | ||
| 68 | - | ||
| 69 | - | ||
| 70 | - | ||
| 71 | - | ||
| 72 | - | ||
| 73 | - | ||
| 74 | - | ||
| 59 | + | UBubbleSort | |
| 60 | + | ... | |
| 61 | + | ||
| 62 | + | var | |
| 63 | + | a: array[0..100] of integer; | |
| 64 | + | begin | |
| 65 | + | ... | |
| 66 | + | BubbleSort(a); | |
| 67 | + | ... | |
| 75 | 68 | ``` | |
| 76 | 69 | ||
| 77 | 70 | ## Voir aussi | |
| 78 | 71 | ||
| 79 | - | ||
| 72 | + | - \[<https://www.youtube.com/watch?v=DXO-nqATduU>\| COMP1 Réviser et Apprendre : Tri à bulle\] | |
| 80 | 73 | ||
| 81 | 74 | --- | |
| 82 | - | ||
| 75 | + | *From the Free Pascal wiki, page "Bubble sort/fr", as it stood on 2020-02-10 after a change by Trev, out of the wiki's dump of 2024-05-26. Copyright stays with the author who wrote it, according to the old wiki's [[Licensing]] page. If you have concerns about this material, [message the admin](/wiki-contact).* |