Answer:
People often sort stacks of documents using a recursive method. For example, imagine you are sorting 100 documents with names on them. First place documents into piles by the first letter, then sort each pile. Looking up words in the dictionary is often performed by a binary-search-like technique, which is recursive.
Step-by-step explanation:
This is just an example.
If this helps please mark as brainliest
Answer:
i have no 1dea the answer. 18794398+1387o79=819
Step-by-step explanation:
1800000000-132987=90
⓵
-4ỿ = 8
Simplify the left side in order to isolate the ỿ!
-4ỿ = 8
+4 +4
Ỿ = 12
⓶
× + 3y - 3z = -26
Simplify the left side in order to isolate the ×, ỿ and z!
× + 3y - 3z = -26
÷3 ÷3
× + ỿ - 3z = -8,66 periodic
÷-3 ÷-3
× + ỿ + z = 2,88 periodic
⓷
2× - 5ỿ + z = 19
Simplify the left side in order to isolate the ×, ỿ and z!
2× - 5ỿ + z = 19
÷2 ÷2
× - 5ỿ + z = 9,5
÷-5 ÷-5
× + ỿ + z = -1,9
Answer:
A)
Step-by-step explanation:
the top one
1
Ive got no idea but if this is the only info u have then im assuming 1
