Answer:
in javascript:
function compute(a, b, c){
let array = [a, b, c];
array.forEach((e,k) => {
if(e >= a && e >= b && e >= c){
console.log("maximum: " + e);
}
if( e <= a && e <= b && e <= c){
console.log("minimum: " + e);
}
}
}
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.
Answer:
Receiving unexpected results from a program
Explanation:
Logic errors are due to the program not producing a desired result.
Family and Friends
you said the answer was that, soooooo
Answer:
A. To set the primary contact on an account record when it is saved
Explanation:
After updating a Contact and then you set the Primary checkbox, the contact becomes the primary contact and this then updates the reference in the Parent Account. Triggers are used for this purpose and not workflow rule. In this case there is only one contact at a time that is set as Primary Contacts, and in the case where an Account does not have any Contacts, the first contact that is created is made the primary and the trigger sets that value in reference.
