Breaking News: Grepper is joining You.com. Read the official announcement!

shell sort algorithm python in recursion

Aries CARANDANG answered on December 13, 2022 Popularity 1/10 Helpfulness 1/10

answer shell sort algorithm python in recursion

shell sort algorithm python in recursion

Comment

# Shell sort in python


def shellSort(array, n):

    # Rearrange elements at each n/2, n/4, n/8, ... intervals
    interval = n // 2
    while interval > 0:
        for i in range(interval, n):
            temp = array[i]
            j = i
            while j >= interval and array[j - interval] > temp:
                array[j] = array[j - interval]
                j -= interval

            array[j] = temp
        interval //= 2


data = [9, 8, 3, 7, 5, 6, 4, 1]
size = len(data)
shellSort(data, size)
print('Sorted Array in Ascending Order:')
print(data)

Popularity 1/10 Helpfulness 1/10 Language python

Source: www.programiz.com

Tags: algorithm python recursion shell

Link to this answer
Share Copy Link