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

sorting algorithms python

Add Answer

Paul Negedu answered on September 18, 2020 Popularity 10/10 Helpfulness 4/10

answer sorting algorithms python

related sorting algorithms in python

related python sort algorithm

sorting algorithms python

Comment

Sorting algorithms implemented in python.
https://github.com/paulnegz/sorts-py
  
def selection_sort(array :list)->list:
    for idx_y, _ in enumerate(array):
        min_idx = idx_y
        for idx in range(idx_y,len(array)):
            if array[idx] < array[min_idx]: min_idx = idx
        array[min_idx], array[idx_y] = array[idx_y], array[min_idx]
    return array    
  
def _insertion_sort(array :list)->list:
    for index in range(1,len(array)):
        back=index-1
        while back>=0 and array[back] > array[back+1]:
            array[back], array[back+1] = array[back+1], array[back]
            back-=1
    return array

def quick_sort(array :list)->list:
    def _quick_sort(array :list)->list:
        if len(array)<=1: return array
        
        pivot, is_bigger = array.pop(), lambda x: x>pivot
        left_partition = _quick_sort([x for x in array if not is_bigger(x)])
        right_partition = _quick_sort([x for x in array if is_bigger(x)])
        return [*left_partition, pivot, *right_partition]
    return _quick_sort(array)
  
  def radix_sort(array :list)->list:
    base, max_length = 10, len(str(max(array)))
    flat_map = lambda arr: reduce(lambda acc, curr: [*acc,*curr], arr)
    for n in range(max_length):
        bucket=[[] for _ in range(base)]
        for item in array: bucket[item//base**n%base].append(item)
        array = flat_map(bucket)
    return array

  def bucket_sort(array :list)->list:
    BUCKET_SIZE = ceil(len(array)**(3/4))
    min_val, max_val = min(array), max(array)

    RANGE = (max_val-min_val+1)/BUCKET_SIZE
    bucket = [[] for _ in range(BUCKET_SIZE)]
    
    get_idx = lambda num: int((num-min_val)/RANGE)
    for num in array: bucket[get_idx(num)].append(num)
    for x in bucket: _insertion_sort(x)
    flat_map = lambda arr: reduce(lambda acc, curr: [*acc,*curr], arr)
    return flat_map(bucket)
  
  def _shell_sort(array: list)->list:
    LENGTH, gap= len(array), len(array)//2
    while gap>0:
        for j in range(gap, LENGTH):
            i=j-gap 
            while i>=0:
                if array[i+gap]>array[i]: break
                else: array[i+gap],array[i]=array[i],array[i+gap]
                i=i-gap 
        gap=gap//2
    return array

Popularity 10/10 Helpfulness 4/10 Language python

Source: Grepper

Tags: python sorting

Link to this answer
Share Copy Link

Contributed on Jun 19 2023

Paul Negedu

0 Answers Avg Quality 2/10

Closely Related Answers

sorting algorithms in python

Comment

9 Sorting Algorithms implementation in Python at this link:
  
https://github.com/shreyasvedpathak/Data-Structure-Python/tree/master/Sorting%20Algorithms

Popularity 10/10 Helpfulness 3/10 Language python

Source: Grepper

Tags: python py

Link to this answer
Share Copy Link

Contributed on Mar 29 2021

Aggressive Albatross

0 Answers Avg Quality 2/10

python sort algorithm

Comment

a = [1, 2, 0, 8, 4, 5, 3, 7, 6]
print(a.sort())

Popularity 10/10 Helpfulness 3/10 Language python

Source: Grepper

Tags: algorithm algo

Link to this answer
Share Copy Link

Contributed on Sep 18 2020

Fair Fish

0 Answers Avg Quality 2/10

sorting algorithms python

Contents

More Related Answers

sorting algorithms python

Closely Related Answers

sorting algorithms in python

python sort algorithm

Grepper

Documentation

Social

Legal

Contact

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