Presentation of two algorithms of sortings - Sorting by pivot - HeapSort [30 mn de lecture - paru le 6/7/2006 12:40:42 PM - Public : Débutant]

Auteur

JEROME WONG-PIN Elève-Ingénieur Supinfo Océan-Indien Promotion SUPINFO 2007    Lui écrire    Tous les projets de cet auteur    Le mini-CV de cet auteur

General

Sommaire

• Introduction
• 1 The sorting by pivot, one of the most popular sortings
•             1.1 Principle
•             1.2 Algorithm of the sorting by pivot
•             1.3 An example of sorting of a table of integer
•             1.4 Arguing or termination of the program
•             1.5 Discussions on the algorithm
•             1.6 An example of its use in the world
• 2 The sorting by heap, an efficient sorting to sort out housing schemes of elements
•             2.1 Principle
•             2.2 Algorithm of the Heapsort
  
•             2.3 An example of sorting of a table of integer
  
•             2.4 Arguing or termination of the program
•             2.5 Discussion on the algorithm
•             2.6 An example of its use in the world
  
• Conclusion