Answer Posted / rakesh

/* Write C programs that implement the following sorting
methods to sort
a given list of integers in ascending order: i) Bubble
sort */

#include <stdio.h>
#define MAX 10

void swapList(int *m,int *n)
{
int temp;
temp = *m;
*m = *n;
*n = temp;
}

// Function for Bubble Sort
void bub_sort(int list[], int n)
{
int i,j;
for(i=0;i<(n-1);i++)
for(j=0;j<(n-(i+1));j++)
if(list[j] > list[j+1])
swapList(&list[j],&list[j+1]);
}

void readlist(int list[],int n)
{
int j;
printf("\nEnter the elements: \n");
for(j=0;j<n;j++)
scanf("%d",&list[j]);
}

// Showing the contents of the list
void printlist(int list[],int n)
{
int j;
for(j=0;j<n;j++)
printf("%d\t",list[j]);
}

void main()
{
int list[MAX], num;
clrscr();
printf("\n\n\n***** Enter the number of elements
[Maximum 10] *****\n");
scanf("%d",&num);
readlist(list,num);
printf("\n\nElements in the list before sorting are:\n");
printlist(list,num);
bub_sort(list,num);
printf("\n\nElements in the list after sorting are:\n");
printlist(list,num);
getch();
}

What is the use of heap sort?

822

---

What is the difference between Strings and Arrays?

1035

---

Why do we use insertion sort?

846

---

Is treeset synchronized?

833

---

Give the example of validating the parenthesis of expression using stack.

1027

---

What is circular queue example?

931

---

Which is faster array or list?

912

---

What is the advantage of the heap over a stack?

997

---

What is dynamic array with example?

968

---

How do you declare A pointer to array of three chars

1028

---

What is an acyclic graph?

1026

---

Define shortest path?

1032

---

How do you reference all the elements in a one-dimension array?

1029

---

Is hashmap an array?

911

---

How do you clear a stack?

918

---