Q5: What time are needed for bubble sort, selection sort, and insertion sort for small size array, respectively?

Goto https://www.cs.usfca.edu/~galles/visualization/ComparisonSort.html, drag the animation speed to max speed, find a time stop watch to find out the time of bubble sort, selection sort, and insertion sort.

Q6: What time are needed for bubble sort, selection sort, and insertion sort for large size array, respectively?

https://www.cs.usfca.edu/~galles/visualization/ComparisonSort.html

Q7: Compare all three simple sorting algorithms, for small size array and large size array, which one is the slowest? Which one is the fastest?

https://www.cs.usfca.edu/~galles/visualization/ComparisonSort.html

http://algoanim.ide.sk/

Q1: What bars are yellow? What bars are green? This animation shows an improved bubblesort algorithm. In this algonthm, we remember the place of the last swap (ch) after each iterration. In next iteration we don't check again those elements, which are already in sorted order (on the right from the place of the last swap) 1-6 WHILE i-1 ch--1 FOR 1-0 to 1-1 IF alj] alj+1] THEN swap aty) alj+ ch = j i-ch ch Fig. 2 Run the Improved Bubblesort 2: What bars are yellow? What bars are green? FOR i " 6 downto 1 max-o FOR -1 to i IF a [max] aj THEN min-j swap ali] a[min] 01 34 Speed of animation: Q4: What yellow bars are representing in insertion sort? What green bars are representing in insertion sort? FOR i-lto 6 j- 1-1 tmp = a[i] WHILE (j >_ 0) and (a[j] > tmp) 3-j-1 alj+1-tmp tmp 0 123456 5 3+1 Speed of animation: Reset Play Average rating: - Please REGISTER er LOG 14, it's totally free! Re stered users can rate animations. add them among their favonites, and mark them as not working Q1: What bars are yellow? What bars are green? This animation shows an improved bubblesort algorithm. In this algonthm, we remember the place of the last swap (ch) after each iterration. In next iteration we don't check again those elements, which are already in sorted order (on the right from the place of the last swap) 1-6 WHILE i-1 ch--1 FOR 1-0 to 1-1 IF alj] alj+1] THEN swap aty) alj+ ch = j i-ch ch Fig. 2 Run the Improved Bubblesort 2: What bars are yellow? What bars are green? FOR i " 6 downto 1 max-o FOR -1 to i IF a [max] aj THEN min-j swap ali] a[min] 01 34 Speed of animation: Q4: What yellow bars are representing in insertion sort? What green bars are representing in insertion sort? FOR i-lto 6 j- 1-1 tmp = a[i] WHILE (j >_ 0) and (a[j] > tmp) 3-j-1 alj+1-tmp tmp 0 123456 5 3+1 Speed of animation: Reset Play Average rating: - Please REGISTER er LOG 14, it's totally free! Re stered users can rate animations. add them among their favonites, and mark them as not working