Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- // This program uses the bubble sort algorithm to sort an
- // array in ascending order.
- #include <iostream>
- using namespace std;
- // Function prototypes
- void sortArray(int [], int);
- void showArray(const int [], int);
- int main()
- {
- // Array of unsorted values
- int values[6] = {7, 2, 3, 8, 9, 1};
- // Display the values.
- cout << "The unsorted values are:\n";
- showArray(values, 6);
- // Sort the values.
- sortArray(values, 6);
- // Display them again.
- cout << "The sorted values are:\n";
- showArray(values, 6);
- return 0;
- }
- //***********************************************************
- // Definition of function sortArray *
- // This function performs an ascending order bubble sort on *
- // array. size is the number of elements in the array. *
- //***********************************************************
- void sortArray(int array[], int size)
- {
- bool swap;
- int temp;
- for(int x =0; x < (size-1) ; x++)
- {
- for (int count = 0; count < (size - 1); count++)
- {
- if (array[count] > array[count + 1])
- {
- temp = array[count];
- array[count] = array[count + 1];
- array[count + 1] = temp;
- }
- }
- }
- }
- //*************************************************************
- // Definition of function showArray. *
- // This function displays the contents of array. size is the *
- // number of elements. *
- //*************************************************************
- void showArray(const int array[], int size)
- {
- for (int count = 0; count < size; count++)
- cout << array[count] << " ";
- cout << endl;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement