Opening book details…
Can I read Everything you wanted to know about the running time of Mergesort but were afraid to ask on EtoBox?
Everything you wanted to know about the running time of Mergesort but were afraid to ask by Ian Parberry is a Computer Science article available to read on EtoBox.
What is Everything you wanted to know about the running time of Mergesort but were afraid to ask about?
Although mergesort is an algorithm that is frequently glossed over in textbooks, it provides fertile ground for planting ideas about algorithm analysis in the minds of students. Why can we assume that __n__ is a power of 2? How big is the increase in constant multiple if we do? And how do we analyze it if we __don't__ ? Here then is an excruciatingly detailed analysis of mergesor t for the student whose enquiring mind truly wants to know.
Who reads Everything you wanted to know about the running time of Mergesort but were afraid to ask?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Ian Parberry
- Publisher
- ACM
- Published
- 1998
- Language
- EN
- Field
- Computer Science (Physical Sciences)