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.
It is the internet callback technology that allows someone browsing the internet to click on words or phrases, enter his or her phone number, and continue browsing. It is a technology that enable one to browse the Internet to cue on a certain website to have a representative call a certain number.<span />
Sample size is not taken into account
-Bubbles
-Explosion
-Pebbles
-Popping Balloon
--Hopping Noise
