Answer Posted / prashant gupta

#include<stdio.h>
#include<conio.h>

void main()
{
int i,j,t;
int a[7]={5,7,8,1,4,2,9}; // You can use any length

for(i=0;i<6;i++)
{
for(j=i+1;j<6;j++)
{
if(a[i]>a[j])
{
t = a[i];
a[i] = a[j];
a[j] = t;
}
}
printf("The Sorted Array is = %d",a[i]);

getch();
}

List the types of tree.

867

---

Are linked lists useful?

856

---

Define a binary tree?

928

---

Why we need cursor implementation of linked lists?

954

---

Write an algorithm to check if there is a loop in a doubly linked list.

904

---

Explain what are the methods available in storing sequential files ?

888

---

What are the different types of data structures?

964

---

What is dynamic array in excel?

858

---

How does a treemap sort?

793

---

Define secondary clustering?

877

---

What is the slowest sorting algorithm?

867

---

Give one example of right rotation.

888

---

How do you find the length of an arraylist?

871

---

What is the best case complexity of quicksort?

868

---

Can we add elements to final list?

876

---