so is it all about codes and codes and codes and codes and codes lol
Answer:
A.)
arr[0] = 10;
arr[1] = 10;
Explanation:
Given the array:
arr = {1,2,3,4,5}
To set the first two elements of array arr to 10.
Kindly note that ; index numbering if array elements starts from 0
First element of the array has an index of 0
2nd element of the array has an index of 1 and so on.
Array elements can be called one at a time using the array name followed by the index number of the array enclosed in square brackets.
arr[0] = 10 (this assigns a value of 10 to the index value, which replace 1
arr[1] = 10 (assigns a value of 10 to the 2nd value in arr, which replaces 2
B) each person gets to contribute in their own unique way
Answer: Option D -- Sorting an already sorted array of size n with quicksort takes O(n log n) time.
Explanation:
Sorting an already sorted array of size n with quicksort takes O(n log n) time is true about sorting functions while other options are wrong.
