Answer:
The final case in selection sort is trivially sorted.
The final iteration in insertion sort is not needed.
Explanation:
For selection sort, you make sub arrays and find the smallest element placing it in the front and repeat until sorted. This guarantees the final element will already be the greatest element, thus it is trivially sorted.
For Insertion sort, you use the initial element and compare it to the previous element and swap if the current is larger than the previous. Using this sort, you will always perform n-1 comparisons where n is the total amount of elements in the array. Thus, there are only 11 iterations for a 12 element array.
Cheers.
The word "only" is absolute.
Answer:
sed '/march/{d;}' birthdays.txt > result
.txt
Explanation:
sed syntax is basically:
<em>sed '/expression/{command;command;...;}' inputfile > outputfile</em>
- First, for the expression part, we use /march/ to match all lines containing that string.
- Then for the command part, we only use {d} command to delete every matching line found.
- The third part contains the input file to process, I have named it birthdays.txt, but it could have been any other file needed.
- Finally "> result
.txt" makes the script output to be saved into a file named result.txt
Answer:
I just want my 5 point lol sorry hope you get your answer
Explanation:
get terraria
Depends on how deep you're willing to go to really,
You need one of a few arrangements of flip flop circuits to keep 1-bit state.
Going deeper, you need either NAND, or NOR gates(or a bunch of other ones) and connectors.
Even deeper, you'll require diodes or transistors to build the logic gates.
Beyond that is particle physics.
