Analisis algoritma berikut ini nyatakan dalam bentuk waktu proses T(n). #include <iostream>using namespace std;

void insertionSortRecursive(int arr[], int n)

{

if (n <= 1)

return;

insertionSortRecursive( arr, n-1 );

int last = arr[n-1];

int j = n-2;

while (j >= 0 && arr[j] > last)

{

arr[j+1] = arr[j];

j--;

}

arr[j+1] = last;

}

void printArray(int arr[], int n)

{

for (int i=0; i < n; i++)

cout << arr[i] <<" ";

}

int main()

{

int arr[] = {12, 11, 13, 5, 6};

int n = sizeof(arr)/sizeof(arr[0]);



insertionSortRecursive(arr, n);

printArray(arr, n);

return 0;

}

​