Write programs for Bubble Sort, Quick sort
- 15 Answers
- 47259 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 |
Which interfaces are implemented by linkedhashset?
What do you mean by heap order property?
What do you mean by balanced trees?
How do you check if a stack is empty or not?
What is difference between tree and binary tree?
Does concat mutate array?
Why null is allowed in hashmap?
Can you store different types in an array?
Define the tree data structure.
Define splay tree?
What is binary search in data structure?
How many parts are there in a declaration statement using data structures?
Windows 
