We do sorting to...............
a) keep elements in random positions
b) keep the algorithm run in linear order
c) keep the algorithm run in (log n) order
d) keep elements in increasing or decreasing order
For the heap sort, access to nodes involves simple......operations.
a) arithmetic
b) binary
c) algebraic
d) logarithmic
.......he sieve technique works in as follows.
a) phases
b) numbers
c) integers
d) routines
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of?
a) divide-and-conquer
b) decrease and conquer
c) greedy nature
d) 2-dimension Maxima
The analysis of Selection algorithm shows the total running time is indeed....in n
a) arithmetic
b) geometric
c) linear
d) orthogonal
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
a) n / 2 elements
b) (n/2) + n elements
c) n / 4 elements
d) n elements
