Towers of Hanoi || BCA Third Semester || Data Structure
If you've gone through the tutorial on recursion, then you're ready to see another problem where recursing multiple times really helps. It's called the Towers of Hanoi. You are given a set of three pegs and nnn disks,...
BCA Third semester||Data Structure | Chapter 4 Linked List Notes
Linked List
BCA Third semester DSA Chapter four Notes . Its Note is Only available for Study Purpose not for Third Party. if you need More Notes of BCA Semester wise complete Please comment us...
SORTING USING SELECTION SORT
SORTING USING SELECTION SORT
SORTING USING SELECTION SORT
#include <stdio.h>
#include <conio.h>
int main()
{
int array, n, i, j, position, temp;
clrscr();
printf("Enter number of elements : n");
scanf("%d", &n);
printf("Enter %d integersn", n);
for (i= 0;i<n;i++)
scanf("%d", &array);
for (i=0;i<(n-1);i++)
{
position = i;
for (j=i+1;j<n;j++)
{
if ( array...
SORTING USING INSERTION SORT
SORTING USING INSERTION SORT
BCA Third Semester
Data Structure
#include <stdio.h>
#include <conio.h>
int main()
{
int n, array, c, d, t;
clrscr();
printf("Enter number of elements : ");
scanf("%d", &n);
printf("Enter %d integersn", n);
for (c = 0; c < n; c++) {
scanf("%d", &array);
}
for (c...
SORTING USING SHELL SORT
SORTING USING SHELL SORT
BCA third semester
data structure
#include<stdio.h>
#include<conio.h>
int array;
void ShellSort(int *array, int n)
{
int i,j,iter, jter, increment, temp;
for(increment = n/2;increment > 0; increment /= 2)
{
for(i = increment; i<n; i++)
{
temp = array;
for(j = i; j >= increment...
SORTING USING QUICK SORT
SORTING USING QUICK SORT
BCA THird Semester
Data Structure
#include<stdio.h>
#include<conio.h>
#define max 10
int a, n, i, l, h;
void main()
{
void input(void);
input();
getch();
}
void input(void)
{
void quick_sort(int a, int l , int h);
void output(int a, int n);
clrscr();
printf("nnHow MAny Element to You Stored (Array...
SHORTING USING MERGE SORT
SHORTING USING MERGE SORT
DATA Structure
BCA Third Semester
#include<stdio.h>
#include<conio.h>
void merge(int ,int ,int ,int );
void break_a(int ,int ,int );
int main()
{
int arr;
int i,size;
clrscr();
printf("nt------- Merge sorting method -------nn");
printf("Enter total no. of elements : ");
scanf("%d",&size);
for(i=0; i<size; i++)
{
printf("Enter %d element :...
SORTING USING BUBBLE SORT
SORTING USING BUBBLE SORT
BCA Third semester
Data Structure
#include<stdio.h>
#include<conio.h>
void main()
{
int arr,i,j,temp;
clrscr();
for(i=0;i<5;i++)
{
printf("Enter elements");
scanf("%d",&arr);
}
for(i=0;i<5;i++)
{
for(j=i+1;j<5;j++)
{
if(arr > arr)
{
temp=arr;
arr=arr;
arr=temp;
}
}
}
for(i=0;i<5;i++)
{
printf(" %d ",arr);
}
getch();
}
OUTPUT
Enter Elements : 40
Enter Elements : 10
Enter Elements : 30
Enter Elements : 60
Enter Elements : 20
After Sorting :
10 20 30 40...
SORTING USING BINARY SEARCH TREE
SORTING USING BINARY SEARCH TREE
BCA THIRD semester
data structure
#include<stdio.h>
#include<conio.h>
#include<malloc.h>
struct node
{
int data;
struct node *right, *left;
};
struct node *nw, *root, *temp;
void creation(struct node *root, struct node *nw)
{
if(nw -> data < root-> data)
{
if(root -> left == NULL)
root -> left...
SEARCH ELEMENT FOR TREE
SEARCH ELEMENT FOR TREE
bca third semester
Data structure
#include<stdio.h>
#include<conio.h>
#include<malloc.h>
struct node
{
int data;
struct node *right, *left;
};
struct node *nw, *root, *temp;
int key,flag=0;
void creation(struct node *root, struct node *nw)
{
if(nw -> data < root-> data)
{
if(root -> left == NULL)
root -> left...