Skip to content
BranchesTags

Latest commit

 

History

1 Commit

Folders and files

NameName
Last commit message
Last commit date
tests
tests
 
 
.3-quick_sort.c.swp
.3-quick_sort.c.swp
 
 
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
 
 
1000-sort_deck.c
1000-sort_deck.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-O
105-O
 
 
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
 
 
deck.h
deck.h
 
 
print_array.c
print_array.c
 
 
print_list.c
print_list.c
 
 
sort.h
sort.h
 
 

Repository files navigation

Background Context

This project is meant to be done by groups of two students. Each group of two should pair program for at least the mandatory part. Resources

Read or watch:

Sorting algorithm
Big O notation
Sorting algorithms animations
15 sorting algorithms in 6 minutes (WARNING: The following video can trigger seizure/epilepsy. It is not required for the project, as it is only a funny visualization of different sorting algorithms)
CS50 Algorithms explanation in detail by David Malan
All about sorting algorithms

About

No description, website, or topics provided.

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

Packages

Contributors

Languages