Write programs for Bubble Sort, Quick sort
- 15 Answers
- 48736 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 |
an array t[100] which contains numbers between 1..99. Return the duplicated value. Try both O(n) and O(n-square).
What do you mean by Runtime Error
How will inorder, preorder and postorder traversals print the elements of a tree?
What exactly is data?
Explain data structure
How to get largest and smallest number in an array?
For addition and deletion. Which one is most preferred: array list or linked list?
Which is more efficient merge sort vs quicksort?
What is sorted list in data structure?
How do you define a set?
create an singly linked lists and reverse the lists by interchanging the links and not the data?
Define a linear and non linear data structure.
Windows 
