Skip to content

Repository files navigation

Big-O Sorting Algorithms

Welcome to the Big-O Sorting Algorithms repository! This project provides implementations of various sorting algorithms in C#, designed for educational purposes. The repository includes the following algorithms:

  • Bubble Sort
  • Bucket Sort
  • Counting Sort
  • Heap Sort
  • Insertion Sort
  • Merge Sort
  • Quick Sort
  • Radix Sort
  • Selection Sort
  • Shell Sort

Purpose

The main goal of this repository is to help users understand and compare the time complexities and efficiencies of different sorting algorithms.

Usage

Each sorting algorithm is implemented as a separate function within its respective file. You can explore each algorithm and see how it operates on different datasets. Feel free to clone this repository and experiment with the code.

TODO

  • Bubblesort
  • Bucketsort
  • Countingsort
  • Heapsort
  • Insertionsort
  • Mergesort
  • Quicksort
  • Radixsort
  • Selectionsort
  • Shellsor

About

Big-O algorithms implementation in C#

Resources

Stars

0 stars

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages