Interested to Buy Any Domain ? << Click Here >> for more details...
Write programs for Bubble Sort, Quick sort
- 15 Answers
- 50523 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 |
Differentiate between priorityqueue and treeset.
What is the difference between hashmap and treemap?
Can you please explain the difference between array_name and &array_name?
Does hashmap allow duplicate keys?
How to print element of Array?
What is difference between rb tree and avl tree?
What is a threaded binary tree? Explain its operation with example?
What do you mean by hash table?
What member function places a new node at the end of the linked list?
What are the 3 types of measurement?
What is precision?
Stack can be described as a pointer. Explain.
Windows 
