Sorting Algorithms and Their Characteristics

The video tutorial covers three main sorting algorithms: selection sort, insertion sort, and merge sort. It explains how each algorithm works, including the process of sorting elements in a list. Selection sort finds the smallest element and places it at the beginning, insertion sort shifts elements to their correct position, and merge sort divides the list into sublists and merges them back into a sorted list. Sorting is crucial in programming, especially as data size increases.

Which of the following is NOT a sorting algorithm mentioned in the introduction?

• Bubble Sort

• Insertion Sort

• Merge Sort

• Selection Sort

What is the main characteristic of the Selection Sort algorithm?

• It divides the list into two halves.

• It selects the smallest element and places it at the beginning.

• It shifts elements one at a time to the correct position.

• It merges sorted sublists into a single list.

In Selection Sort, where is the sorted part of the list located?

• At the back end of the list

• In the middle of the list

• Randomly distributed

• At the front end of the list

How does the Insertion Sort algorithm begin its sorting process?

• By dividing the list into sublists

• By comparing the first two elements

• By selecting the largest element

• By merging sorted elements

What happens if the second element is smaller than the first in Insertion Sort?

• It is left in its position

• It is swapped with the first element

• It is moved to the end of the list

• It is removed from the list

What is the primary strategy used by the Merge Sort algorithm?

• Sorting in place

• Dividing and conquering

• Shifting elements one at a time

• Selecting the smallest element

During the Merge Sort process, what is the list split into?

• Randomly sized sublists

• Equal halves

• Sublists of single elements

• Pairs of elements

What is the final step in the Merge Sort algorithm?

• Selecting the largest element

• Merging sorted sublists

• Dividing the list further

• Shifting elements to the correct position

Why is sorting considered an important component in programming?

• It helps organize data efficiently

• It reduces the size of data

• It eliminates the need for algorithms

• It simplifies data entry

What challenge is often faced with sorting algorithms as the list size increases?

• Reduced speed

• Decreased accuracy

• Increased complexity

• Increased memory usage