CS502
Fundamentals of Algorithms
GDB
It is to inform that Graded Discussion Board will be conducted on 24th and 25th February 2014.
It is to be noted that no extra time will be provided for attempting GDB.
Topic for GDB
Average-case performance of Quick-sort (n log n) is the same as the time complexity of Merge-sort or Heap-sort. While considering the worst-case performance, time complexity is still (n log n) for Merge-sort and Heap-sort, but it grows to (n2) in case of Quick-sort.
Keeping in view the above fact and implementation on virtually modern machine,
“How is Quick Sort really Quick in comparison to the other two algorithms i.e. Merge-sort or Heap-sort”?
Discuss briefly with solid arguments.
In case of any questions, please email us at CS502@vu.edu.pk
Please Share Your GDB / Discuss here:
Fundamentals of Algorithms
GDB
It is to inform that Graded Discussion Board will be conducted on 24th and 25th February 2014.
It is to be noted that no extra time will be provided for attempting GDB.
Topic for GDB
Average-case performance of Quick-sort (n log n) is the same as the time complexity of Merge-sort or Heap-sort. While considering the worst-case performance, time complexity is still (n log n) for Merge-sort and Heap-sort, but it grows to (n2) in case of Quick-sort.
Keeping in view the above fact and implementation on virtually modern machine,
“How is Quick Sort really Quick in comparison to the other two algorithms i.e. Merge-sort or Heap-sort”?
Discuss briefly with solid arguments.
In case of any questions, please email us at CS502@vu.edu.pk
Please Share Your GDB / Discuss here:
Comments
Post a Comment