How many number of passes are used in the Insertion Sort to get the final sorted list?(a) 0 (b) 1 (c) n(d) n -1

How many number of passes are used in the Insertion Sort to get the fi

1.	How many number of passes are used in the Insertion Sort to get the final sorted list?(a) 0 (b) 1 (c) n(d) n -1
Answer» Answer is (d) n – 1