Skip to content

Oluwatos94/sorting_algorithms

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
.gitignore
.gitignore
 
 
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-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

A project on sorting algorithms & Big O. I worked on this project alone.

General

At least four different sorting algorithms What is the Big O notation, and how to evaluate the time complexity of an algorithm How to select the best sorting algorithm for a given input What is a stable sorting algorithm.

About

An ALX project on sorting algorithms and Big O.

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages