Is it okay for Insertion Sort?

Question

https://code.sololearn.com/c8pXzCnM6akf/?ref=app

Answer 1

Jubaer Ahmad Yes, but its worst runtime is O(n²), whereas Heapsort and Mergesort have a worst runtime of only O(n lg n).

Answer 2

When ever you write the swap method you have to check for the pointer identity as below.
Obviously this code works fine without that, but follow the practices.

void swap(int *a, int *b)
{
int temp;
if(a != b)
{
temp = *a ;
*a = *b ;
*b = temp ;
}
}

Answer 3

Jubaer Ahmad There is not a problem. If you pass array the second copy of array has to be made. This will add some latency in your code.

Latency means code execution time.

Answer 4

Read this
https://brilliant.org/wiki/insertion/

Answer 5

Why are you passing array? Don't you think for pointer?

you can use void InsertionSort(int *arr, const int& n) instead of void InsertionSort(int arr[], int n).

Answer 6

$¢𝐎₹𝔭!𝐨𝓝 So where's the problem by doing this?

Answer 7

In next level you can templatize the code to work with other data types also.

Answer 8

$¢𝐎₹𝔭!𝐨𝓝 okay, but the best complexity of Insertion sort is O(n).

My code has same complexity like this?

Answer 9

Hello Jubaer Ahmad I made some changes on your code I think u will see this code
https://code.sololearn.com/cOBneZeKT0A0/?ref=app