Awesome q2a theme
0 votes
6 views

The tightest lower bound on the number of comparisons, in the worst case, for comparison-based sorting is of the order of

  1. $n$
  2. $n^2$
  3. $n \log n$
  4. $n \log^2n$
in Algorithms by (193 points) | 6 views

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
8,430 questions
2,707 answers
13,232 comments
95,452 users