In ith pass of insertion sort, previous (i-1) element are already sorted.

 In ith pass of Bubble sort,sorting in ascending order, the  ith largest element is placed at ith last position .

Insertion sort is the fastest sorting algorithm.

Bubble sort is the fastest sorting algorithm.

The insertion sort algorithm will take maximum ____ passes to sort an array of  n elements

The algorithm that picks one element at a time from unsorted segment and places it to its correct position as the sort order in sorted segment is called ___ sort.

The Bubble sort algorithm will take maximum ____ passes to sort an array of  P elements.

The algorithm that sorts elements by comparing two adjacent elements and swapping them to be in the right order is called ___ sort.

____ refers to the arrangement of elements in a specific order.

Which of the following real time example is based on insertion sort?

For the list [ 34,8,14,51,32,21], how will the list elements look like after second pass in Insertion Sort ?

For the list [34,8,14,51,32,21], how will the list elements  look like after second  pass in Bubble sort ?

How many passes does a bubble sort algorithm take to sort an array of N elements ?

How many passes does an insertion sort algorithm take to sort an array of N elements?

Which of the following are sorting algorithms?

Arranging element of an array or a list in an order is known as _____.