Skip to content
#

ntu

Here are 15 public repositories matching this topic...

Programming Lab Test (Toal time = 1 hr 15 minutes) Instructions 1. This is a closed book test. 2. Lab test will be held on week 8 (3-7 October) of Semester 1 in your lab tutorial session. 3. The question paper contains 5 sections, A, B, C, D and E. Each section contains 6 questions. 4. You are required to answer a total of 5 questions with one q…

  • Updated Mar 18, 2018
  • C

As a divide-and-conquer algorithm, Mergesort breaks the input array into subarrays and recursively sort them. When the sizes of sub-arrays are small, the overhead of many recursive calls makes the algorithm inefficient. This problem can be remedied by choosing a small value of S as a threshold for the size of sub-arrays. When the size of a sub-a…

  • Updated Oct 27, 2017
  • C

Improve this page

Add a description, image, and links to the ntu topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the ntu topic, visit your repo's landing page and select "manage topics."

Learn more