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();
}

Run time memory allocation is known as ?

948

---

What is a static structure?

877

---

What is data structure and why we need them?

841

---

What is the maximum size of array?

862

---

Why concurrenthashmap is fail safe?

919

---

Does hashset maintain order?

868

---

What data type is array?

874

---

Why is merge sort faster?

833

---

Define non-terminal nodes in a tree?

1095

---

Is hashmap a collection?

857

---

Difference between calloc and malloc ?

901

---

What is the use of sorting the data?

873

---

What type of memory allocation is referred for Linked lists?

1141

---

Define parent node?

923

---

Is data structure a data type?

907

---