Insertion sort is a basic method to sort elements in array of integer.
The main idea of insertion sort is moving the smallest element in array to index zero in array while looping from the beginning to the end of array.
