improved_mergesort

Fundamentals of Data Structures in C
Ellis Horowitz, Sartaj Sahni, Susan Anderson-Freed
ISBN 0-7167-8250-2
Computer Science Press
Eighth Printing, 1998

Section 7.6 Merge Sort
Exercise 1

Wrote a function to shift the aelements of an array by 'h' positions, such that
0 <= h < 'length of array'
The time complexity of this operation is O(n) and space complexity is O(1)

Unit tested the code.