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:
The python code is attached
Explanation:
- I defined a function called Fullname
- The function accepts 2 parameters first and last
- last[0] gives the first letter of the last variable
- last[0].upper() modifies the first letter as upper letter
- same applied to variable first
- + sign concatenates strings and variables to the variable name
- the function returns the variable name
Answer:
if(soldYesterday > soldToday){
salesTrend = -1;
} else if(soldToday > soldYesterday){
salesTrend = 1;
}
Explanation:
The if/else statement is more explicit. The first if condition check if soldYesterday is greater than soldToday, if true, then -1 is assigned to salesTrend.
Else if soldToday is greater than soldYesterday, if true, then 1 is assigned to salesTrend.
Answer:
the RAM if i am not mistaking
An effective team leader shows great skills in every area, shows great support and respect to his teammates and is very easy to get along with.
