That works! Thanks. Can you write quicksort now and explain when quicksort is better than bubble sort and vice-versa?
this be good to see you
bubble sort list of int in python def bubblesort(seq):
  for i in range(len(seq)):
    for j in range(len(seq)-1):
      if int(seq[j])>int(seq[1+j]):
        seq[j], seq[1+j] = seq[1+j], seq[j]
  return seq