TEAM 2

What is Sorting ?

• Counting the number of items
• Leaving items unorganized
• Arranging items in a specific order
• Mixing items randomly

What is the Main purpose of Sorting algorithms in computer Science ?

• Managing Network collections

• Creating Random patterns

• To make the data more difficult to understand
• To arrange data in a specific order for easier search and retrieval

What does Stability in Sorting Algorithm refer to

• Randomizing the order of elements in the sorted output
• Ignoring the order of equal elements in the sorted output
• Sorting the elements in reverse order
• Maintaining the relative order of equal elements in the sorted output

What is the advantage of selection sort over other sorting techniques ?

• It requires no additional storage space

• It is scalable

• It works best for inputs which are already sorted

• It is faster than any other sorting technique

Which of the following describes the selection sort algorithm ?

• It repeatedly selects the smallest element and swaps it with the current element

• It divides the array into two subarrays and recursively sorts them

• It compares adjacent elements and swaps them if they are in the wrong order

• It randomly shuffles array until it is in sorted order

What is the Space Complexity of selection sort

• O(1)
• O(n)
• O(log n)
• O(n^2)

What is the time complexity of selection sort algorithm?

• O(n)

• O(n^2)

• O(log n)

• O(n!)

Which step is repeated in Selection Sort until the entire array is sorted?

• Selecting the minimum element and swapping

• Swapping adjacent elements

• Comparing adjacent elements

• Partitioning the array