Skip to content

Alx project : Implement four different sorting algorithms and learn what is the Big O notation, and how to evaluate the time complexity of an algorithm.

Notifications You must be signed in to change notification settings

alyalsayed/sorting_algorithms

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

86 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

C - Sorting algorithms & Big O

This Repository contains projects that make use of different sorting algorithms with their respective Big O notations in separate files. The sorting algorithms covered are:

  • Bubble sort
  • Insertion sort
  • Selection sort
  • Quick sort (Lomuto partition scheme)
  • Shell sort (Using knuth sequence)
  • Cocktail shaker sort
  • Counting sort
  • Merge sort
  • Heap sort
  • Radix sort
  • Bitonic sort
  • Quick sort (Hoarse Partition scheme)

Requirements

  • Editor: The editor used was vi
  • Files were interpreted / compilled on Ubuntu 20.04 using gcc -Wall -Wextra -Werror - pedantic -std=gnu89
  • Betty style code was used

Author

  • Aly Alsayed
  • Nwogha Michael Chimdinma

About

Alx project : Implement four different sorting algorithms and learn what is the Big O notation, and how to evaluate the time complexity of an algorithm.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published