comparisons split by the array size for each increment using the shellsort instrument. Create a test programme that sorts arrays of arbitrary Double values using array sizes that increase by powers of 10 starting at 100, testing the hypothesis that this number is a tiny constant

Write a program to Build a 100-element array with the integers 1 through 100 for which shellsort utilises as many comparisons as it can discover, using increments of 1 4 13 40.

Write a program that will load 100 integers into array X. Separate the even from the ode valued elements. The procedure should place the even values in ascending order startin- from the first location of the original array and place the odd values in ascending orde starting from the last position of the original array.

Write a Java program to prompt the user to enter an integer n between 1 and 20 both inclusive and (error check is required), then create an array arr of size n. The program then will fill up the integer array with powers of 2, so first element will be 20 , second element will be 2^1 , third element will be 2^2 , forth element will be 2^3 .......... and the last element will be 2n^-1.