<h2>Answer:</h2>
<h2>intelligence - centered</h2>
<h2>
Explanation:</h2>
I hope it helps you
Answer:
Question was incomplete and continued the question
For each of the following scenarios, which of these choices would be best? Explain your answer.
BST
Sorted Array
Un-sorted Array
a) The records are guaranteed to arrive already sorted from lowest to highest (i.e., whenever a record is inserted, its key value will always be greater than that of the last record inserted). A total of 1000 inserts will be interspersed with 1000 searches.
b) The records arrive with values having a uniform random distribution (so the BST is likely to be well balanced). 1,000,000 insertions are performed, followed by 10 searches.
Explanation:
Answer for a: Un-sorted array or Un-sorted linked list : as mentioned in the question itself that the records are arriving in the sorted order and search will not be O(log n) and insert will be not be O(n).
Answer for b : Un-sorted array or Un-sorted linkedlist : Number of the items to be inserted is already known which is 1,000,000 but it is very high and at the same time search is low. Unsorted array or Unsorted linked list will be best option here.
Answer:
class Program {
public static void Main (string[] args) {
double number = 1.0;
while(number >= 0.001) {
Console.WriteLine (number);
number /= 2;
}
}
}
Explanation:
Always think carefully about what is in the condition of the while statement. In this case, you want the loop to be executed as long as the number is larger than or equal to 0.001.
5 I don’t think it’s good. I thought it was boring.
