sorting.py

import cmd
import random
import sys

from algorithms.heapsort import heapsort, get_heap_steps
from algorithms.mergesort import mergesort, get_split_steps, get_merge_steps
from utils import colored_text


class SortingShell(cmd.Cmd):
    "Simple sorting cmd shell."

    intro = 'Welcome to sorting command line shell :D'
    prompt = colored_text('(Sorting) ', 'GREEN')
    file = None

    _list = []

    def emptyline(self, *args):
        pass

    def do_create(self, *args):
        "Create random list by given length : create <length of list (2 to 100)>"

        size = args[0]

        if not size.isdigit():
            print('Usage : create <length of list (2 to 100)>')
        else:
            size = int(size)

            if size > 100 or size < 2:
                print('Length of list must be in between 2 and 100')
            else:
                self._list = [random.randint(1, 1 << 8) for i in range(size)]
                print('Created list :', self._list)

    def do_heapsort(self, *args):
        "Sort the list using heapsort algorithm : heapsort"

        if len(self._list) == 0:
            print('You must create list using "create" command first')
        else:
            print('Original list :', self._list, '\n')

            print(colored_text('Yello list', 'YELLOW'), ':', 'heap list')
            print(colored_text(' Blue list', 'BLUE'), ':', 'sorted list by prepending max\n')

            sorted_list = heapsort(self._list)

            num_heap_steps = len(get_heap_steps().items())

            for i, heap_step in get_heap_steps().items():
                heap_list = heap_step.arr[:num_heap_steps - i + 1]
                non_heap_list = heap_step.arr[num_heap_steps - i + 1:]

                if non_heap_list != []:
                    print('Heap step {0}'.format(i).ljust(13), ':',
                        colored_text(str(heap_list)[:-1], 'YELLOW') + ',',
                        colored_text(str(non_heap_list)[1:], 'BLUE'))
                else:
                    print('Heap step {0}'.format(i).ljust(13), ':',
                        colored_text(str(heap_list), 'YELLOW'))
            else:
                print()

            print('Sorted list   :', sorted_list)

    def do_mergesort(self, *args):
        "Sort the list using mergesort algorithm : mergesort"

        if len(self._list) == 0:
            print('You must create list using "create" command first')
        else:
            print('Original list :', self._list, '\n')

            sorted_list = mergesort(self._list)

            for i, split_step in get_split_steps().items():
                print('Split step {0}'.format(i).ljust(13), ':',
                    colored_text(' | ', 'BLUE').join([str(e) for e in split_step]))
            else:
                print()

            num_merge_steps = len(get_merge_steps().items())

            for i, merge_step in sorted(get_merge_steps().items(), reverse=True):
                print('Merge step {0}'.format(num_merge_steps - i + 1).ljust(13), ':',
                    colored_text(' | ', 'BLUE').join([str(e) for e in merge_step]))
            else:
                print()

            print('Sorted list   :', sorted_list)

    def do_exit(self, *args):
        "Exit the shell."

        print('Thank you! Goodbye')

        return True


if __name__ == '__main__':
    SortingShell().cmdloop()