SORT3.cpp

//Author Pulkit Singh

#include <bits/stdc++.h>
using namespace std;

void swap(int * xp, int * yp) {
  int temp = * xp;
  * xp = * yp;
  * yp = temp;
}

void bubbleSort(int arr[], int n) {
  int i, j;
  for (i = 0; i < n - 1; i++) {
    for (j = 0; j < n - i - 1; j++) {
      if (arr[j] > arr[j + 1])
        swap( & arr[j], & arr[j + 1]);
    }
    if (i == 2) {
      for (int k = 0; k < n; k++) cout << arr[k] << " ";
    }
  }
}

void printArray(int arr[], int size) {
  int i;
  for (i = 0; i < size; i++)
    cout << arr[i] << " ";
  cout << endl;
}

int main() {
  int n;
  cin >> n;
  int arr[n];
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  bubbleSort(arr, n);
  cout << "\nSorted array:";
  printArray(arr, n);
  return 0;
}