Answer:
Quick Sort.
Explanation:
Quick Sort will be best suited for an array having 100000 elements instead of the insertion sort algorithm because as we know the average time complexity of quick sort is O(NlogN) and for insertion sort is O(n^2).The sorting totally depends upon the pivot that is being selected in quick sort.
While insertion sort is best suited for arrays that are already sorted it takes O(n) time in those cases.
Since the array that we have is very large and so we need an algorithm that can sort the array faster than the other sorting algorithms.Quick Sort is also inplace and does not requires extra space to do the sorting.
Answer:
- numberRed = numberBlue = FALSE
- numberBlue > numberGreen = FALSE
- numberGreen < numberRed = FALSE
- numberBlue = wordBlue = ILLEGAL
- numberGreen = "Green" = FALSE
- wordRed = "Red" = FALSE
- wordBlue = "Blue" = FALSE
- numberRed <= numberGreen = TRUE
- numberBlue >= 200 = TRUE
- numberGreen >= numberRed + numberBlue = TRUE
- numberRed > numberBlue AND numberBlue < numberGreen = FALSE
- numberRed = 100 OR numberRed > numberBlue = TRUE
- numberGreen < 10 OR numberBlue > 10 = FALSE
- numberBlue = 30 AND numberGreen = 300 OR numberRed = 200 = FALSE
Explanation:
THESE RESULTS ARE VERIFIRED.....
Answer:
A. weekrep101
Explanation:
hope this worked and notice the update
2000 nibbles I think correct me if I’m wrong
