Below is some info for some internet transactions. We want to sort it by time and by location. Which sorting algorithm is appropriate for this particular problem? a. radix sort.
b. heap sort.
c. selection sort.
d. shell sort.

c. selection sort

Explanation:

The best way to sort the internet transactions data based on time and location is selection sort. The algorithms sorting technique is used to sort the complex data in computer programs. Shell sort is the technique which sorts the data apart from each other and reduces interval between them. Heap sort is sorting technique based on binary heap data structure. Radix sort is an integer sorting technique in algorithms.

yes the ansewer is c bc you can look it up!

i think the answer is b.