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 a simple graph?

687

---

What type of data structure is used to perform recursion?

711

---

What is collision in data structure?

669

---

Is bubble sort adaptive?

666

---

Is quicksort greedy algorithm?

677

---

What is data structure explain in detail?

679

---

Why is treeset sorted?

727

---

Will hashmap allow null keys?

678

---

Explain the expression trees?

768

---

State the difference between stacks and linked lists?

721

---

Design a datastructure to represent the movement of a knight on a chess board

719

---

What is array traversing?

666

---

Can hashset contain null?

693

---

How do hash tables work?

672

---

What is bubble sort technique?

671

---