Answer:
1) Selection, bubble and insertion sort requires no moves in the sorted array because there will be n comparisons in the array and no swapping would take place after each comparison so zero moves.
2) Bubble and insertion sort result in 999 comparisons as we are required to iterate only one time over the array. this can be easily explained from the diagram as in bubble sort all the elements will be in their sorted position so each element will be encountered only once.
3) In selection sort, any element is compared with all the elements and accordingly smaller is paced first so in the reverse sorted array there will be at least n^2 comparisons so n^2 moves.
4) in merge sort an array is always divided into n nos of parts and then sorted so in worst case as well as best case the array will be divided so same numbers of moves.
Answer:
what area?
Explanation:
if you need help creating a resume lmk :)
all you really need is
your skill set
-what you're good at
-what you can do
-what are you certified at like
excel, Microsoft office etc.
let me know and I'll send an example
OMG YUHHH
( Also I need one more brainliset until I get expert )
