argonautica / sorting-algorithms Goto Github PK

a beginner-friendly repository made for open source beginners. add any sorting algorithms in any language to this repository

License: MIT License

Java 29.80% Python 10.32% C 7.47% C++ 17.63% Go 2.60% JavaScript 6.42% Kotlin 8.37% C# 11.21% Assembly 3.58% Elixir 0.42% Ruby 1.38% Lua 0.49% Rust 0.32%

hacktoberfest sorting-algorithms sorting hacktoberfest2020

sorting-algorithms's Introduction

Sorting Algorithms

Sorting algorithms implemented in different languages (for hacktoberfest). This repository is open to everyone. Feel free to add any sorting algorithms. The instructions for how to contribute to this repo are down below.

List of Algorithms ⌨️

Language	Algorithms
Assembly	`Bubble Sort` `Quick Sort`
C++	`Interchange Sort` `Bubble Sort` `Heap Sort` `Insertion Sort` `Merge Sort` `Quick Sort` `Selection Sort` `Shell Sort` `Binary Insertion Sort` `Bucket Sort` `Cycle Sort` `K Way Merge Sort` `Radix Sort` `Tree Sort` `PigeonholeSort`
C	`Bubble Sort` `Insertion Sort` `Merge Sort` `Quick Sort` `Selection Sort` `Bubble Sort #2` `Gnome Sort` `Heap Sort` `Radix Sort` `Tree Sort`
C#	`Bubble Sort` `Binary Insertion Sort` `Heap Sort` `Insertion Sort` `Merge Sort` `Quick Sort` `Selection Sort` `Shell Sort`
Go	`Radix Sort` `Bubble Sort` `Insertion Sort` `Counting Sort`
Java	`Bead Sort` `Bogo Sort` `Bubble Sort` `Counting Sort` `Heap Sort` `Insertion Sort` `Merge Sort` `Quick Sort` `Radix Sort` `Selection Sort` `Shell Sort` `Tim Sort` `Comb Sort` `Binary Insertion Sort` `Gnome Sort` `Topological Sort`
Javascript	`Bogo Sort` `Counting Sort` `Heap Sort` `Insertion Sort` `Merge Sort` `Quick Sort` `Bubble Sort` `Shell Sort` `Selection Sort` `Radix Sort`
Lua	`Quick Sort`
Python	`Bogo Sort` `Bubble Sort` `Bucket Sort` `Bubble Sort Recursive` `Gnome Sort` `Insertion Sort` `Merge Sort` `Quick Sort` `Radix Sort` `Selection Sort` `Binary Insertion Sort` `Heap Sort`
Ruby	`Bubble Sort` `Gnome Sort` `Quick sort` `Selection sort` `Sort` `Reverse sort`
Rust	`Bubble Sort`
Kotlin	`Merge Sort` `Bubble Sort` `Selection Sort` `Heap Sort` `Insertion Sort` `Quick Sort` `Bogo SortCounting Sort` `Radix Sort` `Cocktail Shaker Sort`
Elixir	`Selection Sort`

Contributing 🖇️

If there's an existing folder named with your chosen language, create a file for your new algorithm inside, calling it by the algorithm name and use the appropriate file extension i.e. bubbleSort.js. If there aren't any algorithms in your choice of language, feel free to start your own folder and place your implementations inside, and don't forget to update the README.md!

sorting-algorithms's People

Stargazers

Watchers

Forkers

manh16nd thormern viveksdf sankalp112kashyap kefournier rpartha paul2708 om8007 arta666 lass7965 ada-mustafa himanshu7292 daniloeler echpee nayaknavin thuvan96 alfianyusufabdullah natclamp mathiasabreu whitek2 thakurutkarsh22 manaarth zanderbe lakshyajit165 callmeanto drbalar olutobz shashankshirol abhishek5937 nayane95 kajal-mongia meetpaija hmizapgcdjaber gitruili celinelind mahi397 hackhell swampxx maximuskon bartekprzadka azhanali taufiqhidayah klopstedt trungqudinh sarsiz danish1305 aiashwarj001kr vipulsharma18 echojoker andyb129 zmrkrabz vksychev sagar23sj tejuswadbudhe vaibhavgangwar anilsenay bilgehanmb kutaelee rohits301 snunsan vikachubro21 ha1fbyte suchoudh rasmusknothnielsen aamirv1 adityab1500 suufi heriawanfx atikul789 attoftegaard alkatrivedi zyfers sneha-santhosh cdca12 akshu-on-github chahat08 codersinghal goku-kun m-code12 ashiishme swarn4399 coolpulkit deytulsi18 hariprasetia jackie1969 antasgupta rhuancpq swatiidixit ni30kp anproghub slonnoga peterprombutr hrit20 tejasgowda123 sankshitpandoh shikhershukla adammurray-dev emerson-matos aesmi ramanic

sorting-algorithms's Issues

modify readme.md

edit readme so that it has the names of all the sorting algorithms that are in the repo
perhaps links to files with descriptions of each?

Timsort implementation is wrong

The way timsort is written isn't actually timsort, it's just merge sort but replacing the smallest merges with selection sort.

It should be looking for "runs" of already sorted elements and merging then together.

suggestions for improvement

hey guys, not sure how we could improve the repo more, do y'all have any suggestions?
maybe descriptions of algs, website, any good ideas are welcome

modify structure of repo

please make it so that each file follows the naming convention - and is put in its own folder labelled correctly

update readme

can someone update the readme with all the files that are present in the repo?
some haven't been added to the table yet.
also, detailed instructions for newcomers on how to update the readme with the names of files that they add would be nice.
thanks :)