2 votes 2 votes In the absence of a comparator, the time complexity of a generate-and test type of algorithm to sort n numbers would be of the order : (A) log n (B) n2 (C) n (D) n! Algorithms algorithms + – sh!va asked Jul 9, 2016 sh!va 766 views answer comment Share Follow See 1 comment See all 1 1 comment reply pC commented Jul 18, 2016 reply Follow Share Great question . How to approach this kind of questions from Algoritham 0 votes 0 votes Please log in or register to add a comment.