What it does

Sort the list using selection sort. The program will compute the best case and worst case scenario time to execute the list size of 50, 500, 20000. The larger the list, the longer time to sort the list.

How we built it

I used Java language and Netbeans software to code this

Challenges we ran into

understand the best case and worst case scenario of selection sort

Accomplishments that we're proud of

The sorting works!

What we learned

Selection sort has time complexity of O(N^2) and it is inefficient in larger list. Selection sort is more efficient than bubble sort.

Built With

Share this project:

Updates