main sorting algorithms

Elchin Musazade answered on March 25, 2025 Popularity 1/10 Helpfulness 1/10

answer main sorting algorithms

main sorting algorithms

Comment

#Quick Sort Algorithm


    def quickSort(data, left, right):
        if right<= left:
            return 
        else:
            pivot = partition(data, left, right)
            quickSort(data, left, pivot - 1)
            quickSort(data, pivot + 1, right)

        return data

    def partition(data, left, right):
        """This function chooses a pivot point that dertermines the left and right side of the sort"""
        pivot = data[left]
        leftIndex = left + 1
        rightIndex = right

        while True:
            while leftIndex <= rightIndex and data[leftIndex] <= pivot:
                leftIndex += 1
            while rightIndex >= leftIndex and data[rightIndex] >= pivot:
                rightIndex -= 1
            if rightIndex <= leftIndex:
                break
            data[leftIndex], data[rightIndex] = data[rightIndex], data [leftIndex]
            print(data)

        data[left], data[rightIndex] = data[rightIndex], data[left]
        print(data)

        return rightIndex

Popularity 1/10 Helpfulness 1/10 Language whatever

Source: dev.to

Tags: sorting whatever

Link to this answer
Share Copy Link

Contributed on Mar 25 2025

Elchin Musazade

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

main sorting algorithms

Contents

More Related Answers

main sorting algorithms

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.