https://github.com/gervinfung/commonsortingalgorithms

9 most common sorting algorithms, Time and Space complexity provided
https://github.com/gervinfung/commonsortingalgorithms

bubblesort countingsort exchangesort heapsort insertionsort mergesort quicksort selection-sort timsort

Last synced: 12 days ago
JSON representation

9 most common sorting algorithms, Time and Space complexity provided

• Host: GitHub
• URL: https://github.com/gervinfung/commonsortingalgorithms
• Owner: GervinFung
• Created: 2020-12-20T07:23:23.000Z (about 4 years ago)
• Default Branch: main
• Last Pushed: 2020-12-20T07:45:10.000Z (about 4 years ago)
• Last Synced: 2024-10-04T16:22:31.830Z (3 months ago)
• Topics: bubblesort, countingsort, exchangesort, heapsort, insertionsort, mergesort, quicksort, selection-sort, timsort
• Language: Java
• Homepage:
• Size: 6.84 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
## Getting Started

Welcome to the VS Code Java world. Here is a guideline to help you get started to write Java code in Visual Studio Code.

## Folder Structure

The workspace contains two folders by default, where:

- `src`: the folder to maintain sources

- `lib`: the folder to maintain dependencies

## Dependency Management

The `JAVA DEPENDENCIES` view allows you to manage your dependencies. More details can be found [here](https:||github.com|microsoft|vscode-java-pack|blob|master|release-notes|v0.9.0.md#work-with-jar-files-directly).

## 9 most commonly use sorting methods (Time & Space Complexity provided)

Sorting Methods | Best    |   Average   |    Worst    | Space Complexity |

| --- | --- | --- | --- | --- |

Tim Sort        | Ω(n)        | Θ(n log(n)) | O(n log(n)) | O(n)             |

Mergse Sort     | Ω(n log(n)) | Θ(n log(n)) | O(n log(n)) | O(n)             |

Heap Sort       | Ω(n log(n)) | Θ(n log(n)) | O(n log(n)) | O(1)             |

Quick Sort      | Ω(n log(n)) | Θ(n log(n)) | O(n^2)      | O(log(n))        |

Selection Sort  | Ω(n^2)      | Θ(n^2)      | O(n^2)      | O(1)             |

Bubble Sort     | Ω(n)        | Θ(n^2)      | O(n^2)      | O(1)             |

Exchange Sort   | Ω(n)        | Θ(n^2)      | O(n^2)      | O(1)             |

Insertion Sort  | Ω(n)        | Θ(n^2)      | O(n^2)      | O(1)             |

Counting Sort   | Ω(n+k)      | Θ(n+k)      | O(n+k)      | O(k)             |