From 33613a85afc4b1481367fbe92a17ee59c240250b Mon Sep 17 00:00:00 2001 From: Sven Eisenhauer Date: Fri, 10 Nov 2023 15:11:48 +0100 Subject: add new repo --- Bachelor/Prog2/Codebeispiele/7_ch21/fig21_37.CPP | 79 ++++++++++++++++++++++++ 1 file changed, 79 insertions(+) create mode 100644 Bachelor/Prog2/Codebeispiele/7_ch21/fig21_37.CPP (limited to 'Bachelor/Prog2/Codebeispiele/7_ch21/fig21_37.CPP') diff --git a/Bachelor/Prog2/Codebeispiele/7_ch21/fig21_37.CPP b/Bachelor/Prog2/Codebeispiele/7_ch21/fig21_37.CPP new file mode 100644 index 0000000..496b449 --- /dev/null +++ b/Bachelor/Prog2/Codebeispiele/7_ch21/fig21_37.CPP @@ -0,0 +1,79 @@ +// Fig. 21.37: fig21_37.cpp +// Standard library algorithms push_heap, pop_heap, +// make_heap and sort_heap. +#include + +using std::cout; +using std::endl; + +#include +#include + +int main() +{ + const int SIZE = 10; + int a[ SIZE ] = { 3, 100, 52, 77, 22, 31, 1, 98, 13, 40 }; + std::vector< int > v( a, a + SIZE ), v2; + std::ostream_iterator< int > output( cout, " " ); + + cout << "Vector v before make_heap:\n"; + std::copy( v.begin(), v.end(), output ); + + // create heap from vector v + std::make_heap( v.begin(), v.end() ); + + cout << "\nVector v after make_heap:\n"; + std::copy( v.begin(), v.end(), output ); + + // sort elements of v with sort_heap + std::sort_heap( v.begin(), v.end() ); + + cout << "\nVector v after sort_heap:\n"; + std::copy( v.begin(), v.end(), output ); + + // perform the heapsort with push_heap and pop_heap + cout << "\n\nArray a contains: "; + std::copy( a, a + SIZE, output ); + + cout << endl; + + // place elements of array a into v2 and + // maintain elements of v2 in heap + for ( int i = 0; i < SIZE; ++i ) { + v2.push_back( a[ i ] ); + std::push_heap( v2.begin(), v2.end() ); + cout << "\nv2 after push_heap(a[" << i << "]): "; + std::copy( v2.begin(), v2.end(), output ); + + } // end for + + cout << endl; + + // remove elements from heap in sorted order + for ( int j = 0; j < v2.size(); ++j ) { + cout << "\nv2 after " << v2[ 0 ] << " popped from heap\n"; + std::pop_heap( v2.begin(), v2.end() - j ); + std::copy( v2.begin(), v2.end(), output ); + + } // end for + + cout << endl; + + return 0; + +} // end main + +/************************************************************************** + * (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. * + *************************************************************************/ \ No newline at end of file -- cgit v1.2.3