Shell Sort Algorithm -- Java

[AfaqShuaib09]

Shell Sort Algorithm

Description:

Shell Sort is an optimization of Insertion Sort, where elements are sorted over increasing intervals (called gaps) rather than adjacent positions. This allows the exchange of elements that are far apart, which can lead to faster convergence on a sorted array compared to regular Insertion Sort. As the algorithm progresses, the gap is reduced, eventually performing a final pass using a gap of 1, effectively running a standard Insertion Sort.

Task:

Implement the Shell Sort algorithm in [language] to sort an array of integers. The solution should:

• Accept an array of integers as input.
• Sort the array in ascending order using Shell Sort.
• Return the sorted array.

Key Details:

The gap sequence can be calculated by starting with n/2 (where n is the array length) and halving the gap until it reaches 1.
Ensure the algorithm works efficiently with both small and large input arrays.

Resources:

• Wikipedia - Shell Sort
• Time complexity: O(n^2) in the worst case, but faster in practice for many inputs.

Example:

Input:

[12, 34, 54, 2, 3]

Output:

[2, 3, 12, 34, 54]

Additional Notes:

• Include test cases to verify correctness.
• Ensure that the code adheres to project style guidelines and is well-documented.

[AfaqShuaib09]

Hey @Ayush7-BIT Please assign me this issue. I'll be creating the PR against this issue Thanks