Interested to Buy Any Domain ? << Click Here >> for more details...
Write programs for Bubble Sort, Quick sort
- 15 Answers
- 50975 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 can I study data structures and algorithms?
What is array and its types with example?
Can arraylist be resized?
What are all the classes and interfaces that are available in the collections?
How can I learn data structures?
What is a tech stack?
What is a B tree?
0 Answers Akamai Technologies,
How arraylist increase its size?
State the properties of a binary tree?
What are the applications of priority queues?
What are the different types of data structures?
What are the properties of binary heap?
Windows 
