 The idea is to arrange the list of elements so that, starting anywhere, taking every "h"th element produces a sorted list.Such a list is said to be "h"-sorted.It can also be thought of as "h" interleaved lists, each individually sorted.