From 33613a85afc4b1481367fbe92a17ee59c240250b Mon Sep 17 00:00:00 2001
From: Sven Eisenhauer <sven@sven-eisenhauer.net>
Date: Fri, 10 Nov 2023 15:11:48 +0100
Subject: add new repo

---
 Bachelor/Prog1/examples/ch05/Fig05_15.cpp | 77 +++++++++++++++++++++++++++++++
 1 file changed, 77 insertions(+)
 create mode 100644 Bachelor/Prog1/examples/ch05/Fig05_15.cpp

(limited to 'Bachelor/Prog1/examples/ch05/Fig05_15.cpp')

diff --git a/Bachelor/Prog1/examples/ch05/Fig05_15.cpp b/Bachelor/Prog1/examples/ch05/Fig05_15.cpp
new file mode 100644
index 0000000..bcdd13a
--- /dev/null
+++ b/Bachelor/Prog1/examples/ch05/Fig05_15.cpp
@@ -0,0 +1,77 @@
+// Fig. 5.15: fig05_15.cpp
+// This program puts values into an array, sorts the values into
+// ascending order, and prints the resulting array.
+#include <iostream>
+
+using std::cout;
+using std::endl;
+
+#include <iomanip>
+
+using std::setw;
+
+void bubbleSort( int *, const int );    // prototype
+void swap( int * const, int * const );  // prototype
+
+int main()
+{
+   const int arraySize = 10;
+   int a[ arraySize ] = { 2, 6, 4, 8, 10, 12, 89, 68, 45, 37 };
+
+   cout << "Data items in original order\n";
+
+   for ( int i = 0; i < arraySize; i++ )
+      cout << setw( 4 ) << a[ i ];
+
+   bubbleSort( a, arraySize );  // sort the array
+
+   cout << "\nData items in ascending order\n";
+
+   for ( int j = 0; j < arraySize; j++ )
+      cout << setw( 4 ) << a[ j ];
+
+   cout << endl;
+
+   return 0;  // indicates successful termination
+
+} // end main
+
+// sort an array of integers using bubble sort algorithm
+void bubbleSort( int *array, const int size )
+{
+   // loop to control passes
+   for ( int pass = 0; pass < size - 1; pass++ )
+
+      // loop to control comparisons during each pass
+      for ( int k = 0; k < size - 1; k++ )
+
+         // swap adjacent elements if they are out of order
+         if ( array[ k ] > array[ k + 1 ] )
+            swap( &array[ k ], &array[ k + 1 ] );
+
+} // end function bubbleSort
+
+// swap values at memory locations to which 
+// element1Ptr and element2Ptr point
+void swap( int * const element1Ptr, int * const element2Ptr )
+{
+   int hold = *element1Ptr;
+   *element1Ptr = *element2Ptr;
+   *element2Ptr = hold;
+
+} // end function swap
+
+/**************************************************************************
+ * (C) Copyright 1992-2003 by Deitel & Associates, Inc. and Prentice      *
+ * Hall. All Rights Reserved.                                             *
+ *                                                                        *
+ * DISCLAIMER: The authors and publisher of this book have used their     *
+ * best efforts in preparing the book. These efforts include the          *
+ * development, research, and testing of the theories and programs        *
+ * to determine their effectiveness. The authors and publisher make       *
+ * no warranty of any kind, expressed or implied, with regard to these    *
+ * programs or to the documentation contained in these books. The authors *
+ * and publisher shall not be liable in any event for incidental or       *
+ * consequential damages in connection with, or arising out of, the       *
+ * furnishing, performance, or use of these programs.                     *
+ *************************************************************************/
-- 
cgit v1.2.3