Write programs for Bubble Sort, Quick sort
- 15 Answers
- 47325 Views
- Cognizant, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / nuyer
2
3
4
4
5
6
4
34
5
45
345
45
42
5
5
5
532
5
345
34
53
5
35
34
534
5
345
34
534
5
35
35
534
346
45
654
654
6
456
45
6
6
546
45
64
56
456
4
6
| Is This Answer Correct ? | 1 Yes | 0 No |
Answer / ganga
all the above programs are wrong!!!
heres a perfect one.. simple logic!
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
{
if(a[i]>a[j])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
// now print the elements n see
| Is This Answer Correct ? | 1 Yes | 0 No |
What are threaded binary trees?
Explain what are the methods available in storing sequential files ?
What is the need of sorting?
What is faster array or arraylist?
How does arraylist size work?
Does treemap sort automatically?
Where will be the free node available while inserting a new node in a linked list?
applications of linked lists and mostly used linked list?
What are the disadvantages of linear list?
What is harvesting in agriculture?
What is the difference between list, set and map?
What is a b+ tree? Explain its uses.
Windows 
