In ___________, the number of elements to be sorted is small enough to fit into the process's main memory.

Related MCQs

• ______________ algorithms use auxiliary storage (such as tapes and hard disks) for sorting because the number of elements to be sorted is too large to fit into memory.
• In CUDA memory model there are following memory types available: a) Registers; b) Local Memory; c) Shared Memory; d) Global Memory; e) Constant Memory; f) Texture Memory.
• Given an array of n elements and p processes, in the message-passing version of the parallel quicksort, each process stores ---------elements of array
• Speedup obtained when the problem size is _______ linearly with the number of processing elements.
• The number and size of tasks into which a problem is decomposed determines the __
• The number of tasks into which a problem is decomposed determines its?
• The number and size of tasks into which a problem is decomposed determines the?
• Time Complexity of Breadth First Search is? (V – number of vertices, E – number of edges)
• Time Complexity of DFS is? (V – number of vertices, E – number of edges)
• The odd-even transposition algorithm sorts n elements in n phases (n is even), each of which requires ------------compare-exchange operations