The precise time complexity of which of the following problems has not yet been established by researchers?
A. Sorting a list
B. Searching through a list for a particular entry
C. The traveling salesman problem
D. Listing all possible subcommittees within a given committee
Answer:C
The precise time complexity of which of the following problems has not yet been established by researchers?
A. Sorting a list B. Searching through a list for a particular entry C. The traveling salesman problem D. Listing all possible subcommittees within a given committee