Interested to Buy Any Domain ? << Click Here >> for more details...
Write programs for Bubble Sort, Quick sort
- 15 Answers
- 51053 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 |
How does quick sort work?
What is linear and non linear structure?
What is the difference between Array and LinkedList?
Explain the common uses of tree database.
If you do not initialize an array what will happen?
What is the difference between length () and size () of arraylist?
What are priority queues?
State the merit of linked representation of binary trees?
What are vectors used for in real life?
What are the tasks performed during inorder traversal?
What is difference between hashmap and treemap?
Can we insert null in set?
Windows 
