how can I rewrite this code

Question

1. void insertion_with_jumps(string a[], int n, int jump):
2. Performs insertion sort on the given array using the given jump. This does not necessarily sort the array (unless the jump is 1) and is only one step in Jumping Sort.
3. void jumping_sort(string a[], int n):
4. Sorts the array by calling function insertion_with_jumps using the following sequence of jumps: 2n​,4n​,8n​,…,1.

#THE CODE#

void insertion_with_jumps(string a[], int n, int jump) {

for(int i=jump;i<n;i++){

string arr=a[i];

int j;

for(j=i-jump;j>=0 && arr<a[j];j=j-jump){

a[j+jump] = a[j];}

a[j+jump]=arr;}

}

void jumping_sort(string a[], int n) {

for(int jump=n/2; jump>0; jump=jump/2){

insertion_with_jumps(a, n, jump);

}

}

Answer 1

It is called the SHELL SORT.

Here is the implementation taken from geeks for geeks dot org:

// Java implementation of ShellSort

class ShellSort

{

/* An utility function to print array of size n*/

static void printArray(int arr[])

{

int n = arr.length;

for (int i=0; i<n; ++i)

System.out.print(arr[i] + " ");

System.out.println();

}

/* function to sort arr using shellSort */

int sort(int arr[])

{

int n = arr.length;

// Start with a big gap, then reduce the gap

for (int gap = n/2; gap > 0; gap /= 2)

{

// Do a gapped insertion sort for this gap size.

// The first gap elements a[0..gap-1] are already

// in gapped order keep adding one more element

// until the entire array is gap sorted

for (int i = gap; i < n; i += 1)

{

// add a[i] to the elements that have been gap

// sorted save a[i] in temp and make a hole at

// position i

int temp = arr[i];

// shift earlier gap-sorted elements up until

// the correct location for a[i] is found

int j;

for (j = i; j >= gap && arr[j - gap] > temp; j -= gap)

arr[j] = arr[j - gap];

// put temp (the original a[i]) in its correct

// location

arr[j] = temp;

}

}

return 0;

}

// Driver method

public static void main(String args[])

{

int arr[] = {12, 34, 54, 2, 3};

System.out.println("Array before sorting");

printArray(arr);

ShellSort ob = new ShellSort();

ob.sort(arr);

System.out.println("Array after sorting");

printArray(arr);

}

}