QMI sort

Sep. 21, 2019

I am improving quicksort faster and secure in C language under Linux.

Summary of my papers

    1. Asymmetric Quicksort: New quicksort using a pivot hole instead of swaps.

    2. Ticket sort: Indirect sort to guarantee the time complexity to O(n log(n)).

    3. QMI sort: Hybrid sorting of Asymmetric Quicksort and another. -- Investigating.

How to evaluate

You can evaluate sorting algorithms with a USB memory stick.

  1. Make a working disk.

    1. Run scripts to evaluate.

  2. Load the data to LibreOffice Calc.

How to launch Eclipse on a virtual machine

You can build the test programs on a virtual machine.

  1. Download a virtual machine for this project.

    1. Install VirtualBox and its extension on your PC.

    2. Launch the VirtualBox, and then import the downloaded virtual machine.

    3. Choose the imported virtual machine "qmisort", and then click the start icon.

    4. Install VirtualBox GuestAddition in the virtual machine.

    5. Click the Eclipse icon on the desktop.

How to build a test program

    1. Launch Eclipse in a development environment on a USB memory stick or a virtual machine.

    2. Choose a project in the Project Explorer.

    3. Click a hammer icon or choose a building type as the following picture.

    1. Run a program to test.

    2. $ random.awk | ~/workspace/Sort/Debug/Sort -hV 1

Others

Web clips

PDF files