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:
yessss I tooo have a fire at my home
lolololololololololo
ok have a great day what is your name ?
Based on the information given the data should be stored in flash memory.
<h3>
What is flash memory:</h3>
Flash memory is a memory storage space that is used to store data or information on a computer.
Flash memory is vital as it help to retain information or data that are stored on a computer after power is removed which inturn means that store data can be retrieve when needed.
Example of flash memory are:
Inconclusion the data should be stored in flash memory.
Learn more about flash memory here:brainly.com/question/6835146
The enter key is used when we want to go directly to the next line while writing whereas through word wrap the cursor automatically shifts to the next line when the word limit for a particular line is exceeded
