Southperry.net › Social › Rubik's Cube v
Quicksort implementation issue - Java

Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
Linear Mode
Quicksort implementation issue - Java
nRxUs
Member
***
Posts: 136
Threads: 0
Joined: 2011-06
Gender: Male
Sexual Orientation: Straight
Country Flag: peru
IGN: iatLnbandLt
Server: Broa
Level: 170
Job: Shadower
Guild: ForgeKeepers
#10
2012-05-04, 01:54 AM
Merge sort is supposed to be faster than quick sort.
On worst case scenarios quick sort is O(n^2) while Merge sort is O(nlogn).
Find
Reply


Messages In This Thread
Quicksort implementation issue - Java - by Russt - 2012-04-29, 06:21 PM
Quicksort implementation issue - Java - by Corn - 2012-05-02, 03:36 PM
Quicksort implementation issue - Java - by nRxUs - 2012-05-04, 01:54 AM
Quicksort implementation issue - Java - by Spaz - 2012-05-04, 07:27 AM
Quicksort implementation issue - Java - by Corn - 2012-05-04, 07:38 AM
Quicksort implementation issue - Java - by Russt - 2012-05-05, 03:55 AM

Forum Jump:


Users browsing this thread: 1 Guest(s)