emory-courses / dsa-java

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

[QZ#3] RadixSortQuiz Recursion (MSD) #59

Closed MimiOlayeye closed 4 years ago

MimiOlayeye commented 4 years ago

For my RadixSortQuiz, I'm thinking of using recursion for creating sub buckets to compare the next significant digit of the numbers within a shared bucket. However, for my recursive call, how can I set a new beginIndex and endIndex for the specific bucket I'm focusing on?

My code: (line 17 is what I'm referring to) https://github.com/MimiOlayeye/dsa-java/blob/master/src/main/java/edu/emory/cs/sort/distribution/RadixSortQuiz.java

jdchoi77 commented 4 years ago

@MimiOlayeye this is a right direction; how you keep track of the beginIndex of endIndex for each sub-bucket is the key of this assignment; we can discuss about it during the office hours.