Write programs for Bubble Sort, Quick sort
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 is faster arraylist or linked list?
Given an unsorted linked list, and without using a temporary buffer, write a method that will delete any duplicates from the linked list?
Explain stacks and queues in detail.
Why are b trees used?
What are data members?
What do u mean by array?
What is data structure and data type?
What is a concurrenthashmap?
What is max heapify?
Define double hashing?
Differentiate between an array and an arraylist.
What is the difference between array and stack?