Data Structure

Write a program to sort elements of given array having ‘n’ numbers of element, using Selection sort.

Data Structure

July 6, 2020 0 comments

Write a program to sort elements of given array having ‘n’ numbers of element, using Selection sort.

Write a program to sort elements of given array having ‘n’ numbers of elements, using Selection sort. #include #include void main() { clrscr(); int size, arr[50], i, j, temp; cout<>size; cout<<“Enter Array Elements : “; for(i=0; i>arr[i]; } cout<<“Sorting array using selection sort…n”; for(i=0; i<size; i++) { for(j=i+1; jarr[j]) { temp=arr[i]; arr[i]=arr[j]; arr[j]=temp; } } […]

How to Change WordPress Password From cPanel in phpMyAdmin

Data Structure

July 6, 2020 0 comments

Write a program to generate Fibonacci series with the help of recursion.

#include #include int recfib(int n) { if(n==1) { return 0; } else if(n<3) { return 1; } else { return(recfib(n-1)+recfib(n-2)); } } void main() { clrscr(); int n; cout<<"n Fibonacci series generation using recursion"; cout<>n; for(int i=1;i<=n;i++) { cout<<recfib(i)<<" "; } getch(); }

July 6, 2020 0 comments

Write a program to implement the concept of pointer to array access in functions.

#include #include main() { int *p,i,n; void modify(int *,int); clrscr(); cout<>n; for(i=0;i<n;i++) { cout<<"n A["<<i<>*(p+i); } cout<<"nnn"; cout<<"n Before calling the function for modification elements are :n"; for(i=0;i<n;i++) { cout<<"n A["<<i<<"]="<<*(p+i); } modify(p,n); cout<<"n After modification each element incremented by 500 n"; for(i=0;i<n;i++) { cout<<"n A["<<i<<"]="<<*(p+i); } getch(); return(0); } void modify(int *t, int s) […]

July 6, 2020 0 comments

/Wrtite a program to sort elements of given array having ‘n’ numbers of elements, using Insertion sort

#include #include main() { int a[100]; int i,n,temp,j,k; clrscr(); cout<>n; cout<<"enter array :" ; for(i=0;i>a[i]; } for(i=1;i=0 && a[j]>temp) { a[j+1]=a[j]; j–; } a[j+1]=temp; } for(i=0;i<n;i++) { cout<<a[i]; } getch(); }

July 6, 2020 0 comments

Write a program to search an element of choice from the array having ‘n’ number of element, using Linear Search.

#include #include main() { int a[100],i,n,search; cout<>n; cout<<"n enter elements :"; for(i=0;i>a[i]; } cout<>seacrh; for(i=0;i<n;i++) { if(a[i]==search) { cout<<"n found at location :"<<i+1; } else { cout<<"n not found :"; } getch(); }

July 6, 2020 0 comments

Write a program to sort elements of given array having ‘n’ number of elements,using Merge Sort.

#include #include main() { int a[50],c[100],n,i; void merge(int *,int,int); void mr(int*,int,int,int,int); clrscr(); cout<>n; cout<<"n Enter the elements of array n"; for(i=0;i<n;i++) { cout<<"n a["<<i<>a[i]; } merge(a,0,n-1); cout<<"nnn MERGED ARRAY IN ASCENDING ORDER IS n"; for(i=0;i<n;i++) { cout<<"n A["<<i<<"]="<<a[i]; } getch(); return(0); } void mr(int *a,int lb,int le,int rb,int re) { cout<<"n FROM MERGING n"; cout<<"nn […]