Alon Kesselman

Hi friends Thanks in advance to those who help fail to solve the question One of the simplest algorithms for sorting is called Insert Sort. - At the beginning of the algorithm, the unsorted sub-array is the entire array. - On the left side of the array, we will have a sorted sub-array, which in each iteration will grow by one limb. - At the beginning of the algorithm, the sorted subset is empty. - In each iteration we will look at the member belonging to the unsorted subset, and we will put it in the appropriate place in the sorted subset. - The consequences are that the sorted area grows by one, and the non-sorted area by one. - Ka