Java Script?

Thanks again to all. Just a couple of questions.





1. An internal sort uses:


a. no information that is outside of the sorting algorithm.


b. files that can be stored in memory.


c. data resulting from an inner join.


d. less time than N2 to sort N items.


e. none of the above.





2. The quicksort worst case is produced by __________ files.


a. Gaussian


b. nearly ordered


c. random


d. nearly reverse-ordered


e. randomly ordered





3. Radix sort is based on the abstraction of:


a. comparing keys.


b. eliminating keys.


c. decomposing keys.


d. both a and b


e. both a andc


f. both b and c





4. Bottom-up mergesort is a ______________ algorithm.


a. recursive


b. divide and conquer


c. brute-force


d. non-recursive


e. none of the above





Thanks again

Java Script?
2 b)
Reply:Have you tried:


1. Reading your textbook


2. Talking to other folks in your class


or


3. Posting this in the "Homework Help" category?





You ought to at least TRY to do your own homework, otherwise, you're cheating yourself.

customer survey