Which sorting algorithm works by repeatedly swapping adjacent elements if they are in the wrong order?

Which sorting algorithm works by finding the smallest element from the unsorted portion of the array and swapping it with the first element?

Which sorting algorithm builds the final sorted array one element at a time by comparing it to the already sorted array?

Which sorting algorithm is not suitable for large datasets due to its quadratic time complexity, but is easy to implement and understand?

Which sorting algorithm is known for its simplicity and ease of implementation but may not be the most efficient for larger datasets?

Which sorting algorithm repeatedly selects the maximum element from the unsorted portion of the array and places it at the end of the sorted portion?

Which sorting algorithm involves comparing adjacent elements and swapping them if they are in the wrong order, gradually moving the highest value to the end of the array?

Which sorting algorithm works by finding the minimum element from the unsorted portion of the list and swapping it with the element at the beginning of the unsorted portion?

Which sorting algorithm builds the final sorted list one element at a time by inserting each element in its correct position?

Which sorting algorithm is best suited for sorting a small number of elements or nearly sorted lists due to its simplicity and efficiency?