Skip to content

Latest commit

 

History

History
37 lines (32 loc) · 2.15 KB

README.md

File metadata and controls

37 lines (32 loc) · 2.15 KB
Raw

0x1B. C - Sorting algorithms & Big O

This repository is about Big O notation and sorting algorithms

Projects:

  1. Bubble sort (File: 0-bubble_sort.c, 0-O)
    • Write a function that sorts an array of integers in ascending order using the Bubble sort algorithm
  2. Insertion sort (File: 1-insertion_sort_list.c, 1-O)
    • Write a function that sorts a doubly linked list of integers in ascending order using the Insertion sort algorithm
  3. Selection sort (File: 2-selection_sort.c, 2-O)
    • Write a function that sorts an array of integers in ascending order using the Selection sort algorithm
  4. Quick sort (File: 3-quick_sort.c, 3-O)
    • Write a function that sorts an array of integers in ascending order using the Quick sort algorithm
  5. Shell sort - Knuth Sequence (File: 100-shell_sort.c)
    • Write a function that sorts an array of integers in ascending order using the Shell sort algorithm, using the Knuth sequence.
  6. Cocktail shaker sort (File: 101-cocktail_sort_list.c, 101-O)
    • Write a function that sorts a doubly linked list of integers in ascending order using the Cocktail shaker sort algorithm
  7. Counting sort (File: 102-counting_sort.c, 102-O)
    • Write a function that sorts an array of integers in ascending order using the Counting sort algorithm
  8. Merge sort (File: 103-merge_sort.c, 103-O)
    • Write a function that sorts an array of integers in ascending order using the Merge sort algorithm
  9. Heap sort (104-heap_sort.c, 104-O)
    • Write a function that sorts an array of integers in ascending order using the Heap sort algorithm
  10. Radix sort (File: 105-radix_sort.c)
    • Write a function that sorts an array of integers in ascending order using the Radix sort algorithm
  11. Bitonic sort (File: 106-bitonic_sort.c, 106-O)
    • Write a function that sorts an array of integers in ascending order using the Bitonic sort algorithm
  12. Quick Sort - Hoare Partition scheme (File: 107-quick_sort_hoare.c, 107-O)
    • Write a function that sorts an array of integers in ascending order using the Quick sort algorithm
  13. Dealer (File: 1000-sort_deck.c, deck.h)
    • Write a function that sorts a deck of cards.

Authors