#quicksort

#Increases the recursion limit for Python
import sys
sys.setrecursionlimit(2000)

def partition(a,left,right):
    marker = left
    for i in range (left,right):
        if a[i]<a[left]:
            marker = marker + 1
            a[i],a[marker] = a[marker],a[i]
            
    a[left],a[marker] = a[marker],a[left]
    return marker

def quicksort(array,left,right):
    if left < right:
        pivot = partition(array,left,right)
        quicksort(array,left,pivot)
        quicksort(array,pivot+1,right)

file = open("townlist.txt","r")
townlist = []
for line in file:
    town = line.strip()
    town = town.lower()
    townlist.append(town)

quicksort(townlist,0,len(townlist))
print(townlist)