Answer:
20 will be displayed on the console.
Explanation:
Given code is:
var numList = [10,20,30];
console.log(numList[numlist.length-2]);
The first line of code declares an array named numList and assigns it values given in the square brackets.
The second line of code is written to display the element on the index obtained by [numlist.length-2]
[numlist.length-2] means the second index.
Hence,
after running the code on JavaScript editor and dry running the code
20 will be displayed on the console.
Answer:
A. We all learn differently (edge 2020)
Explanation:
Answer:
Worst case time of Heapsort is better than worst case time of Quicksort.
Explanation:
Worstcase of Heapsort is nlog(n). Worstcase time of Quicksort is (n^2). Heapsort is comparison based sorting algorithm. Heapsort divides input into sorting. It is a selection sort in which we send maximum inputs for maximum elements at end. Quicksort is divide and conquer algorithm. It is considered as efficient sourcing algorithm.
1.) narrative = a THATS all I can answer rn sorryyyy
I actually do have one tho. Try Megan Tha Stallion.
