Quicksort implemented in Python 3

quicksort.py

from random import randrange

def qsort(list):
  if len(list) > 1:
    pivot = list.pop(randrange(0, len(list)))
    a = qsort([i for i in list if i < pivot])
    b = qsort([i for i in list if i >= pivot])
    return a + [pivot] + b
  else:
    return list

if __name__ == '__main__':
  from sys import argv
  from random import shuffle

  list = list(range(int(argv[1])))
  shuffle(list)
  list = qsort(list)
  print(all(list[i] <= list[i+1] for i in range(len(list)-1)))