A python implementation of the selection sort algorithm

selection_sort.py

'''
Created on Nov 26, 2011

@author: Mahmoud
'''

def sort(seq):
  pos = 0
  length = len(seq)
  for i in seq:
    unsorted = seq[pos:length]
    smallest = minimum(unsorted)
    seq.remove(smallest)
    seq.insert(pos, smallest)
    pos += 1
  return seq

def minimum(seq):
  value = seq[0]
  for i in seq:
    if i < value:
      value = i 
  return value
 
def main():
  print sort([5, 10, 2, 9, 0, 3])
 
if __name__ == '__main__':
    main()