Improved insertion sort

[hasinaxp]

To improve insertion sort you can reduce the search time of finding the place to insert . One approach will be to use binary search instead of linear search.😉

[jddeep]

Yes 👍 Anyone wants to work on this can do so. Make the changes in the present .cpp file in the PR.

[Sayan-dev]

lets do it

[tarmas99]

Try to validate your proposal by creating a large list of say 10^7 randomly generated elements, and compare the timing.
See which type of searching technique improves the time.
No need to do complexity analysis now, get a understanding of it by looking at the amount of time it takes.

[tarmas99]

@hasinaxp @jddeep @Sayan-dev if not wrong, the main condition for binary search is to have the array of interest to be sorted before hand.