https://github.com/cgrade/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
https://github.com/cgrade/sorting_algorithms

Last synced: 12 days ago
JSON representation

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

• Host: GitHub
• URL: https://github.com/cgrade/sorting_algorithms
• Owner: cgrade
• Created: 2023-01-31T05:45:16.000Z (almost 2 years ago)
• Default Branch: master
• Last Pushed: 2023-01-31T05:50:29.000Z (almost 2 years ago)
• Last Synced: 2024-11-11T16:12:02.380Z (2 months ago)
• Language: C
• Homepage:
• Size: 7.81 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
## 0x1B. C - Sorting algorithms & Big O

## All Tasks

** Task 0. Bubble sort

Write a function that sorts an array of integers in ascending order using the Bubble sort algorithm

** Task 1. Insertion sort

Write a function that sorts a doubly linked list of integers in ascending order using the Insertion sort algorithm

** Task 2. Selection sort

Write a function that sorts an array of integers in ascending order using the Selection sort algorithm

** Task 3. Quick sort

Write a function that sorts an array of integers in ascending order using the Quick sort algorithm

** Task 4. Shell sort - Knuth Sequence

Write a function that sorts an array of integers in ascending order using the Shell sort algorithm, using the Knuth sequence

** Task 5. Cocktail shaker sort

Write a function that sorts a doubly linked list of integers in ascending order using the Cocktail shaker sort algorithm

** Task 6. Counting sort

Write a function that sorts an array of integers in ascending order using the Counting sort algorithm

** Task 7. Merge sort

Write a function that sorts an array of integers in ascending order using the Merge sort algorithm

** Task 8. Heap sort

Write a function that sorts an array of integers in ascending order using the Heap sort algorithm

** Task 9. Radix sort

Write a function that sorts an array of integers in ascending order using the Radix sort algorithm

**Task 10. Bitonic sort

Write a function that sorts an array of integers in ascending order using the Bitonic sort algorithm

** Task 11. Quick Sort - Hoare Partition scheme

Write a function that sorts an array of integers in ascending order using the Quick sort algorithm

 **Task 12: Dealer; Write a function that sorts a deck of cards.

** Author: Abraham Elijah