33 lines
682 B
C++
33 lines
682 B
C++
//Patriche Robert Cosmin
|
|
#include <iostream>
|
|
using namespace std;
|
|
|
|
void insertionSort(int arr[], int n) {
|
|
for (int i = 1; i < n; i++) {
|
|
int key = arr[i];
|
|
int j = i - 1;
|
|
|
|
while (j >= 0 && arr[j] > key) {
|
|
arr[j + 1] = arr[j];
|
|
j--;
|
|
}
|
|
arr[j + 1] = key;
|
|
}
|
|
}
|
|
|
|
void printArray(int arr[], int n) {
|
|
for (int i = 0; i < n; i++) {
|
|
cout << arr[i] << " ";
|
|
}
|
|
cout << endl;
|
|
}
|
|
|
|
int main() {
|
|
int arr[] = {12, 11, 13, 5, 6};
|
|
int n = sizeof(arr) / sizeof(arr[0]);
|
|
insertionSort(arr, n);
|
|
cout << "Sorted array: ";
|
|
printArray(arr, n);
|
|
return 0;
|
|
}
|