Answer:
Short term memory
Explanation:
Is the capacity an individual has to hold on to a small amount of information for a short period of time without altering it, it is used to remember information like phone numbers, passwords etc. It is also known as primary or active memory.
If short time memories is not rehearsed, they don't last and are easily forgotten, they actually last for about 20-30 seconds.
Aspects of short term memory :
1. Limited capacity : in a short term memory at most 7 items can be stored at a time.
2. Limited capacity : information is short lived and can be lost through distraction and with time.
3. Encoding.
Answer:
yeah but I gotta re-download it
A sort function sorts in an ascending or desceding order
The true statement is that the function would sort in decreasing order.
<h3>What is a sort function?</h3>
A sort function is a code segment that is used to reorder a list in ascending or descending order, when called or evoked
<h3>The order of the sort function</h3>
The code segment is given as:
if (list[index] < list[index + 1]) {
temp = list [index];
list[ index] = list [index +1];
list[index +1] = temp;
}
In the above code, we can see that the code compares a list element with the next element on the list, and the larger value comes to the front
This means that the sort function sorts in decreasing order
Read more about code segments at:
brainly.com/question/16397886
Answer:
Explanation:
( n cards are there initially )
we pick out the first card in random it takes n-1 comparisons to figure out
its Equivalence card - n-1 steps
Two cards have been eliminated ( this leaves us with 2 and n-2 cards)
we pick out the 2nd card in random it takes n-3 comparisons to figure out
its Equivalence card - n-3 steps
we continue to do this.. till all cards are exhausted ( leaves us with 2
and n-4 cards again)
the last comparison will
have
- n-(n-3)
the sum of all these steps - (n-1) + (n-3) + (n-5) + .........+
(n-(n-3))
if you draw this in the form of a tree.
n - n
2
n-2 - n
2
n-4 - n-2
2
n-6 - n-4
2
n-8 - n- 6
the height of the tree will be log n , sum @ each level is at most n
Yeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeesss i have
