C++ Project

You will implement Shell sort using insertion sort and bubble sort for sorting subarrays. You will use the following sequences for Shell sort:  h(1) = 1, h(i) = 2h(i1) +1, for i > 1. We shall refer to this sequence as Seq1.  f1;2;3;4;6;:::;2 p3 q ;:::;3 q 0 g, where 3q 0 is the largest powers of 3 that is smaller than the size of the array to be sorted. We shall refer to this sequence as Seq2. Note that for this project, the integers in this sequence can always be used to form a triangle, as shown in the lecture notes