search

emory-courses / dsa-java

Data Structures and Algorithms in Java
https://emory.gitbook.io/dsa-java/
42 stars 55 forks source link

[HW#1] #97

Closed ddalama closed 4 years ago

ddalama commented 4 years ago

Hello,

HW1 says:

"The easiest way is to merge all rows in the input array into an 1D-array then sort it using IntroSort. The implementation of this strategy is provided to establish the baseline: HybridSortBaseline. Your goal is to design a sorting mechanism that gives a noticeable speed-up over this baseline."

We have to do something other than "merging all rows in the input array into a 1D-array and then sorting it", correct?

brendacano commented 4 years ago

yeah, you can't combine them into a 1d and then sort it. you have to do something before at least

ddalama commented 4 years ago

Got it, thanks

jdchoi77 commented 4 years ago

@brendacano thanks for answering this.