Skip to content

luzejunior/APA_Sorting

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

33 Commits
 
 
 
 
 
 
 
 

Repository files navigation

APA_Sorting

Here you can find simple sorting algorithms implementations using C language.

Version 1.0.0

  • Insertion Sort
  • Selection Sort

Version 1.1.0

  • Merge Sort
  • Quick Sort
  • Heap Sort

Version 1.2.0

  • Counting Sort
  • Radix Sort

Requirements:

  • Ubuntu 17.04.
  • GCC 6.3.0 or above.

Compiling:

To compile you have to simple type make on your console:

	$ make

Running:

To run, you have to envoke make and type the algorithm you want to run.

Insertion Sort Algorithm

If you want to use the Insertion Sort algorithm:

	$ make insertion

Selection Sort Algorithm

If you want to use the Selection Sort algorithm:

	$ make selection

Merge Sort Algorithm

If you want to use the Merge Sort algorithm:

	$ make merge

Quick Sort Algorithm

If you want to use the Quick Sort algorithm:

	$ make quick

Heap Sort Algorithm

If you want to use the Heap Sort algorithm:

	$ make heap

Counting Sort Algorithm

If you want to use the Counting Sort algorithm:

	$ make counting

Radix Sort Algorithm

If you want to use the Radix Sort algorithm:

	$ make radix

PS: Use this algorithm only with "samples/text.txt".

Comparison:

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published