What is the name of the sorting method that refers to sorting a given list of elements and swapping them if they are unordered ?

The correct answer is Bubble Sort.

Key Points

•  Bubble Sort 
  • ​It sorts a given list of elements by repeatedly comparing the adjacent elements and swapping them if they are unordered.
  • For a list with n elements, the bubble sort makes a total of n – 1 passes to sort the list.
  • In each pass, the required pairs of adjacent elements of the list will be compared.
  • In order to arrange elements in ascending order, the largest element is identified after each pass and placed at the correct position in the list.
  • This can be considered as the largest element being ‘bubbled up’. Hence the name Bubble sort.

Additional Information

• Deque or Double Ended Queue is a type of queue in which insertion and removal of elements can either be performed from the front or the rear.
• Selection Sort
  • ​To sort a list having n elements, the selection sort makes (n-1) number of passes through the list.
  • The list is considered to be divided into two lists - the left list containing the sorted elements, and the right list containing the unsorted elements.
  • Initially, the left list is empty, and the right list contains all the elements.
• Insertion Sort
  • ​Like Selection sort, in Insertion sort also, the list is divided into two parts - one of sorted elements and another of unsorted elements.
  • Each element in the unsorted list is considered one by one and is inserted into the sorted list at its appropriate position.
  • In each pass, the sorted list is traversed from the backward direction to find the position where the unsorted element could be inserted.