Which of the following algorithms does not need sorting of elements before performing a search?Group of answer choicesBinary SearchExponential SearchJump SearchSequential Search

The algorithm that does not need sorting of elements before performing a search is Sequential Search.

Here's why:

1. Binary Search: This algorithm works by repeatedly dividing in half the portion of the list that could contain the item, until you've narrowed down the possible locations to just one. For this to work, the list must be sorted.

2. Exponential Search: This algorithm involves two steps: finding a range where the element might be present and then performing a binary search within that range. For this to work, the list must be sorted.

3. Jump Search: This algorithm works by checking a fixed number of steps ahead instead of going through the list one by one. For this to work, the list must be sorted.

4. Sequential Search: This algorithm works by looking at each element in the list one by one, starting from the first element. It does not require the list to be sorted.