n(n-1)/2(bubble sort) n=3 (3*2)/2=3(n) ans:n

What are the average number of comparisons required to sort
3 elements?

Question Posted / jaiprakash

2 Answers
7000 Views
DRDO, I also Faced
E-Mail Answers

Answer Posted / jaiprakash

n(n-1)/2(bubble sort)
n=3
(3*2)/2=3(n)

ans:n

Is This Answer Correct ?

13 Yes

1 No

Post New Answer View All Answers

Please Help Members By Posting Answers For Below Questions

What is pragma c?

1118

Is fortran still used today?

1091

a way in which a pointer stores the address of a pointer which stores the value of the target value a) reference b) allocation c) multiple indirection d) none

1155

Why is structure padding done in c?

1129

What is else if ladder?

1019

What is the argument of a function in c?

1049

What are the 4 types of programming language?

1125

Which of these functions is safer to use : fgets(), gets()? Why?

1096

to print the salary of an employee according to follwing calculation: Allowances:HRA-20% of BASIC,DA-45% of BASIC,TA-10%. Deductions:EPF-8% of BASIC,LIC-Rs.200/-Prof.Tax:Rs.200/- create c language program?

2178

Explain how can you tell whether a program was compiled using c versus c++?

1101

What are header files and explain what are its uses in c programming?

1131

What is #include conio h?

996

What is difference between structure and union in c?

989

I just typed in this program, and it is acting strangely. Can you see anything wrong with it?

1009

What is character set?

1168