GitHunt
M-

m-ehsan/SortAlgsTimes

Compare sorting algorithms efficiencies.

SortAlgsTimes

A WPF project that caclulates and compares some sorting algorithms efficiencies.

Sort algorithms used in this project

  • Bubble sort
  • Insertion sort
  • Quick sort
  • Merge sort
  • Heap sort
  • Pigeonhole sort
  • Counting sort
  • Radix sort
  • Shell sort
  • Binary insertion sort

Features

  • Array size is defined by user
  • Supported array types: byte, short, int, long, string
  • String length range is also defined by user
  • Counts number of comparisons among array elements for each sort algorithm
  • Times are measured by accuracy of 10-7 of a second
  • Sort operations can be either ascending or descending
  • Input array can be sorted initially
  • Display array content from before and after the sort operation
  • View a simple implementation for each sort algorithm in C#

Todo

  • Add support of manually insertion of array elements

Languages

C#100.0%

Contributors

MIT License
Created November 12, 2016
Updated February 15, 2020
m-ehsan/SortAlgsTimes | GitHunt