Interested to Buy Any Domain ? << Click Here >> for more details...
Write programs for Bubble Sort, Quick sort
- 15 Answers
- 51066 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 is the difference between b tree and binary search tree?
Define internal nodes?
What is the need for path compression?
What is a string or array type?
How do you clear a stack?
What is meant by a dynamic array?
Which sorting technique is best in worst case?
What are the different types of hash functions?
What is a hashmap in c?
List the differences between comparable and comparator interface?
What is linked list ?
Stack can be described as a pointer. Explain.
Windows 
