class Sorter():
"""Sorter implements several algorithms to sort a list.

`unsorted_tuple`: A tuple of random integers to be sorted.

`algorithm`: A string contains name of the algorithm to be used for sorting.
            Valid valus are 'bubble', 'default', 'insert', and 'merge'.

Each sorting method make a list copy of `unsorted_tuple` and maintains the original order.

"""

def __init__(self):
   """Sorter constructor.

   By default, the `algorithm` is set as 'default' to use the built-in sort()

   """
   self.unsorted_tuple = tuple([])
   self.algorithm = 'default'

def generate_new_tuple(self, n):
   """Generate a n-length tuple of random integers for `unsorted_tuple`

   `n` is an integer indicates the length of the list.

   Random integers are in a range from 0 to 9223372036854775807 (sys.maxsize)

   The method generate_new_tuple() first generates a new list of `n` length
   containing random integers, converts the newly generated list to a tuple,
   assigns the tuple to `self.unsorted_tuple`, and returns None.

   """
   ### Task 1(a) ###
   lst = []
   for i in range(n):
         lst.append(random.randint(0, maxsize))

   ### Task 1(a) END ###
   self.unsorted_tuple = tuple(lst)

Before you begin: Read all of Miller/Ranum chapters 1, 2 and 3 and...