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

List out the basic operations that can be performed on a stack?

841

---

Explain how is linked list implemented?

864

---

Define linear data structures?

947

---

Can we store null in arraylist?

860

---

How do you do a heap sort?

812

---

Explain linear linked implementation of Stack and Queue?

997

---

How long does it take to master data structures and algorithms?

1077

---

Which sorting has less time complexity?

867

---

Can arraylist be null?

865

---

Can you sort a string?

753

---

Why sorting is used?

870

---

Is arraylist heterogeneous?

836

---

Define leaves?

959

---

What is basic data structure?

847

---

What is variable size arrays?and why we use it?

972

---