wbrawner/algorithms
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions
A simple repository used to learn algorithms by coding them myself
8 commits 3 branches 0 tags 114 KiB
Java 100%
Find a file
Billy Brawner f6cc3e2878 Add Heapsort algorithm
2018-10-11 16:38:07 -05:00
.idea Add insertion sort algorithm 2018-10-05 23:43:33 -05:00
gradle/wrapper Add merge sort algorithm 2018-10-05 02:20:16 -05:00
sorting Add Heapsort algorithm 2018-10-11 16:38:07 -05:00
build.gradle Add merge sort algorithm 2018-10-05 02:20:16 -05:00
gradlew Add merge sort algorithm 2018-10-05 02:20:16 -05:00
gradlew.bat Add merge sort algorithm 2018-10-05 02:20:16 -05:00
README.md Add selection sort algorithm 2018-10-06 00:28:45 -05:00
settings.gradle Add merge sort algorithm 2018-10-05 02:20:16 -05:00

README.md

Algorithms

This repository is meant for me to compile a list of examples of different algorithms that I have learned of, and develop a working implementation. These implementations may not be the most efficient, so please do point it out to me if you see something that could be improved upon. The complexity notations were taken from the Big O Cheatsheet

Sorting

Algorithm Implementation Tests Worst Time Complexity Worst Space Complexity
Bubble Sort BubbleSort.java ParameterizedBubbleSortTest.java O(n²) O(1)
Insertion Sort InsertionSort.java ParameterizedInsertionSortTest.java O(n²) O(1)
Merge Sort MergeSort.java ParameterizedMergeSortTest.java O(n log(n)) O(n)
Selection Sort SelectionSort.java ParameterizedSelectionSortTest.java O(n²) O(1)

Building/Testing

./gradlew test

To keep things simple, the tests share the same data where possible.