Given a huge data set of integers, what would be the advantages of using map and reduce techniques over traditional sorting algorithms such as quicksort and mergesort?
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Given a huge data set of integers, what would be the advantages of using map and reduce techniques over traditional sorting algorithms such as quicksort and mergesort?
Map/reduce is more or less just a (scalable, common) way of describing a parallel computation. So you’d express a traditional sorting algorithm, like mergesort or quicksort, as a map/reduce if you wanted to do it as a parallel computation.
It’s not a question of “is map/reduce better than mergesort or quicksort,” because map/reduce is just a tool for implementing a sorting algorithm like mergesort or quicksort in a parallel way.