https://github.com/pgaref/javasorting

A project to evaluate a variety of sorting algorithms implementations
https://github.com/pgaref/javasorting

Last synced: 4 days ago
JSON representation

A project to evaluate a variety of sorting algorithms implementations

• Host: GitHub
• URL: https://github.com/pgaref/javasorting
• Owner: pgaref
• License: mit
• Created: 2014-03-01T13:12:14.000Z (over 10 years ago)
• Default Branch: master
• Last Pushed: 2014-03-05T18:47:17.000Z (over 10 years ago)
• Last Synced: 2023-08-05T02:53:54.950Z (over 1 year ago)
• Language: Java
• Size: 160 KB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README
  • License: LICENSE

Awesome Lists containing this project

README

        
===Project 1 - Sorting 

We implemented the project according to the given details. The project is also exported as JAR to work as shown in the example.

We implemented 2 sorting algorithms , the insertion sort as asked and the bubble sort. The reason we chose bubble sort as the 

second sorting algorithm is because it is similar to insertion sort and someone could use our project to compare these algorithms in practice!

 

In more detail insertion sort is more efficient than bubble sort because in insertion sort the elements comparisons are less as compare to bubble sort. 

In insertion sorting algorithm we compare the value until all the prior elements are lesser than compared value is not found. 

This means that the all previous values are lesser than compared value. Thus it is more efficient than the bubble sort.

Insertion sort is a good choice for small values and for nearly-sorted values. 

Of course we have to note that there are more efficient algorithms such as quick sort, heap sort, or merge sort for large value