nums = [2, 51, 6, 1242421254, 5, 0]
lenums = len(nums) - 1
Flag = True
while Flag:  
  Flag = False
  for i in range(lenums):
    if nums[i] > nums[i+1]:
               a = nums[i]
               nums[i] = nums[i+1]
               nums[i+1] = a
               Flag = True
print(nums)

import random

def KhoarSort(nums):
  if len(nums) <= 1:
    return nums
  else:
    x = random.choice(nums)
    m = [x] * nums.count(x)
    l = [elem for elem in nums if elem < x]
    r = [elem for elem in nums if elem > x]
    return KhoarSort(l) + m + KhoarSort(r) 

nums = [2, 51, 6, 1242421254, 5, 0]
print(KhoarSort(nums))

py3

import random

def KhoarSort(nums):
  if len(nums) <= 1:
    return nums
  else:
    x = random.choice(nums)
    m = [x] * nums.count(x)
    l = [elem for elem in nums if elem < x]
    r = [elem for elem in nums if elem > x]
    return KhoarSort(l) + m