Skip to content

CallMeGig/sorting_algorithms

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
.gitattributes
.gitattributes
 
 
0-O
0-O
 
 
0-bubble_sort.c
0-bubble_sort.c
 
 
0-main.c
0-main.c
 
 
1-O
1-O
 
 
1-insertion_sort_list.c
1-insertion_sort_list.c
 
 
1-main.c
1-main.c
 
 
100-main.c
100-main.c
 
 
100-shell_sort.c
100-shell_sort.c
 
 
101-O
101-O
 
 
101-cocktail_sort_list.c
101-cocktail_sort_list.c
 
 
101-main.c
101-main.c
 
 
102-O
102-O
 
 
102-counting_sort.c
102-counting_sort.c
 
 
102-main.c
102-main.c
 
 
103-O
103-O
 
 
103-main.c
103-main.c
 
 
103-merge_sort.c
103-merge_sort.c
 
 
2-O
2-O
 
 
2-main.c
2-main.c
 
 
2-selection_sort.c
2-selection_sort.c
 
 
3-O
3-O
 
 
3-main.c
3-main.c
 
 
3-quick_sort.c
3-quick_sort.c
 
 
README.md
README.md
 
 
README.md.bak
README.md.bak
 
 
print_array.c
print_array.c
 
 
print_list.c
print_list.c
 
 
sort.h
sort.h
 
 

Repository files navigation

Sorting Algorithms & Big O

This repository holds some implementations of sorthing algorithms: bubble sort, insertion sort, selection sort, quick sort (utilizing Lomuto's partition), etc.

Description of what each file shows:

  • sort.h ----------- header file with all function prototypes
  • print_array.c ---- holds print_array function
  • print_list.c ----- holds print_list function
  • #-O -------------- best case, average case, and worst case time complexities

About

No description, website, or topics provided.

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

 
 
 

Contributors

Languages