13SS_6b_PG1_Algorithmen_Datenstrukturen_Suchen_Sortieren_Stud_01_21.pdf

Implementierung von Bubble-Sort
FB Informatik
Prof. Dr. R.Nitsch
/* BubbleSort - Sorts a subsequence [pfirst,plast)
@param pfirst pointer to first element of subsequence
@param plast pointer to one-past-the-end element of the subsequence */
// version 1 (with pointer)
void bubbleSort( int* pfirst, int* plast ) {
}
for ( int* plastu=plast-1; plastu>pfirst; --plastu )
for ( int* pp=pfirst ; pp