An implementation of bubble and merge sort in order to sort a random array of numbers. Bubble sort is O(n^2) and merge sort O(log n). The program shows a graph visualising the array and the operations are also timed.
-
Notifications
You must be signed in to change notification settings - Fork 0
isaacbarker/sortingalgorithms
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A Java program implementing bubble and merge sort algorithms.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published