// C++ program for implementation
// of Bubble sort
#include <bits/stdc++.h>
using namespace std;
// A function to implement bubble sort
void bubbleSort(int arr[], int (&ind)[], int n)
{
int i, j;
for (i = 0; i < n - 1; i++) {
// Last i elements are already
// in place
for (j = 0; j < n - i - 1; j++) {
if (arr[j] > arr[j + 1]) {
swap(ind[j], ind[j + 1]);
}
}
}
}
// Function to print an array
void printArray2(int arr[], int ind[], int size)
{
int i;
for (i = 0; i < size; i++)
cout << "i=" << i << " " << arr[ind[i]] << " ";
cout << endl;
}
void printArray(int arr[], int size)
{
int i;
for (i = 0; i < size; i++)
cout << "i=" << i << " " << arr[i] << " ";
cout << endl;
}
// Driver code
int main()
{
int arr[] = { 5, 1, 4, 2, 8};
int N = sizeof(arr) / sizeof(arr[0]);
int index[N];
for (int i = 0; i < N; i++) {
index[i] = i;
}
cout << "Index array: \n";
printArray(index, N);
bubbleSort(arr, index, N);
cout << "Sorted Index array: \n";
printArray(index, N);
cout << "Sorted Original array: \n";
printArray2(arr, index, N);
cout << "Original array: \n";
printArray(arr, N);
return 0;
}
// This code is contributed by rathbhupendra