Skip to content

LawsonLawson/sorting_algorithms

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

62 Commits
0-O
0-O
 
 
0-bubble_sort.c
0-bubble_sort.c
 
 
1-O
1-O
 
 
1-insertion_sort_list.c
1-insertion_sort_list.c
 
 
100-shell_sort.c
100-shell_sort.c
 
 
101-O
101-O
 
 
101-cocktail_sort_list.c
101-cocktail_sort_list.c
 
 
102-O
102-O
 
 
102-counting_sort.c
102-counting_sort.c
 
 
103-O
103-O
 
 
103-merge_sort.c
103-merge_sort.c
 
 
104-O
104-O
 
 
104-heap_sort.c
104-heap_sort.c
 
 
105-radix_sort.c
105-radix_sort.c
 
 
106-O
106-O
 
 
106-bitonic_sort.c
106-bitonic_sort.c
 
 
107-O
107-O
 
 
107-quick_sort_hoare.c
107-quick_sort_hoare.c
 
 
2-O
2-O
 
 
2-selection_sort.c
2-selection_sort.c
 
 
3-O
3-O
 
 
3-quick_sort.c
3-quick_sort.c
 
 
README.md
README.md
 
 
print_array.c
print_array.c
 
 
print_list.c
print_list.c
 
 
sort.h
sort.h
 
 

Repository files navigation

0x1B. C - Sorting algorithms & Big O

A team implementation of a Sorting Algorithm

Objective

This project was implemented in the C Programming Language to explore various sorting algorithms and analyze their time complexity under different scenarios.

Compiling:

Program will be compiled this way:

gcc -Wall -Wextra -Werror -pedantic -std=gnu89 *.c -o sorting_algorithm

By: Lawson Israel Pascal and Patrick A. Noblet

About

A team implementation of a Sorting Algorithm

Resources

Readme
Activity

Stars

2 stars

Watchers

1 watching

Forks

1 fork
Report repository

Releases

No releases published

Packages

 
 
 

Contributors

Languages