Sorting Algorithms & Big O

This is the sorting algorithms repository where it is stored the implementations of some sorting algorithms

---

About this project

• In computer science, a sorting algorithm is an algorithm that puts elements of a list in a certain order.
• Big-O notation is a relative representation of the complexity of an algorithm.

Implementing some Sorting Algorithms

Bubble Sort

This sorting algorithm is comparison-based algorithm in which each pair of adjacent elements is compared and the elements are swapped if they are not in order.

Insertion Sort

A simple sorting technique that scans the sorted list, starting at the beginning, for the correct insertion point for each of the items from the unsorted list.

Selection Sort

This sorting algorithm is an in-place comparison-based algorithm in which the list is divided into two parts, the sorted part at the left end and the unsorted part at the right end. Initially, the sorted part is empty and the unsorted part is the entire list.

Quick Sort

This works by iterating over the input array, swapping elements that are strictly less than a pre-selected pivot element. They appear earlier in the array, but on a sliding target index.

Authors

• Sergio Orejarena / Github - Twitter .
• Duvan Rodelo / Github - Twitter .

Finished 16 / 06 / 2021