Esempio n. 1
0
def run_test(fp):
    '''
    :param fp: file pointer to read in values
    :return: number of right and the length of the linked list

    creates linked lists and runs merge sort, then checks for correct result
    '''
    queue = stu_lq.LinkedQueue()
    count, answer = AddValues(queue, fp)
    stu_qs.quick_sort(queue)

    return check(answer, queue)
Esempio n. 2
0
    InsertionSort.insertion_sort(test_list)
    finish = time.time()
    print("********************************")
    print("InsertionSort: ", test_list)
    print("time: %f" % (finish - start))
    print("\n")

    test_list = [
        1, 5, 52, 4, 23, 1, 32, 4, 5, 6, 19, 4234, 100, 2, 3, 45, 68, 125, 37,
        54614, 2, 46, 67, 1, 5, 52, 4, 23, 1, 32, 4, 5, 6, 19, 4234, 100, 2, 3,
        45, 68, 125, 37, 54614, 2, 46, 67, 1, 5, 52, 4, 23, 1, 32, 4, 5, 6, 19,
        4234, 100, 2, 3, 45, 68, 125, 37, 54614, 2, 46, 67
    ]
    size = len(test_list)
    start = time.time()
    QuickSort.quick_sort(test_list, 0, size - 1)
    finish = time.time()
    print("********************************")
    print("QuickSort: ", test_list)
    print("time: %f" % (finish - start))
    print("\n")

    test_list = [
        1, 5, 52, 4, 23, 1, 32, 4, 5, 6, 19, 4234, 100, 2, 3, 45, 68, 125, 37,
        54614, 2, 46, 67, 1, 5, 52, 4, 23, 1, 32, 4, 5, 6, 19, 4234, 100, 2, 3,
        45, 68, 125, 37, 54614, 2, 46, 67, 1, 5, 52, 4, 23, 1, 32, 4, 5, 6, 19,
        4234, 100, 2, 3, 45, 68, 125, 37, 54614, 2, 46, 67
    ]
    size = len(test_list)
    start = time.time()
    test_list = MergeSort.merge_sort(test_list)
Esempio n. 3
0
#!/usr/bin/env python
# coding=utf-8

__author__ = 'iHuahua'

import QuickSort


def condition(a, b):
    if a > b:
        return True
    else:
        return False


arr = [2, 8, 7, 9, 3, 5, 6, 4, 1]
QuickSort.quick_sort(arr)
print(arr)
QuickSort.quick_sort(arr, condition)
print(arr)
Esempio n. 4
0
import BubbleSort
import SelectionSort
import InsertionSort
import ShellSort
import QuickSort
import MergeSort

import Demo

test_data = [10, 3, 4, 62, 13, 4, 78, 9, 7]
print(test_data)
# BubbleSort.bubble_sort(test_data)
# SelectionSort.selection_sort(test_data)
# InsertionSort.insertion_sort(test_data)
# ShellSort.shell_sort(test_data)
QuickSort.quick_sort(test_data)
# MergeSort.merge_sort(test_data)

print(test_data)