I want to know how to sort the list in descending order without using the built-in function of the list.

import random a = random.sample(range(1,100,10) #using the random module sample, random.sample(range, end value, sampling count) smallest = a[0] for i in a: if i < smallest: smallest = i A = smallest

print(a)
print(A)

I want to learn how to sort in descending order without using the list embedding function.

python list sorting

2022-09-22 16:56

1 Answers

Code using the famous sorting algorithm quicksort.

def sort(array):
    less = []
    equal = []
    greater = []

    if len(array) > 1:
        pivot = array[0]
        for x in array:
            if x < pivot:
                less.append(x)
            if x == pivot:
                equal.append(x)
            if x > pivot:
                greater.append(x)
        return sort(less)+equal+sort(greater)
    else:
        return array

Note: This code is partially modified from a similar question posted in stack overflow.

2022-09-22 16:56

If you have any answers or tips

Popular Tags

python x 4647

android x 1593

java x 1494

javascript x 1427

c x 927

c++ x 878

ruby-on-rails x 696

php x 692

python3 x 685

html x 656