Wednesday, 23 September 2015

Safe array in c/c++ source code, Array source code in c/c++, source code,

Safe array in c/c++ source code, Array source code in c/c++, source code,
// safe_arry.cpp : Defines the entry point for the console application.
//


Safe array in c/c++ source code, 

For More:>  Sorting......, selection sort..., merge sort....., insertion Sort....., General Tree....Binary Tree..... and many more......









#include<iostream.h>

int const size=10;


class safe_array
{
int array[size];
public:

safe_array()
{
for(int i=0;i<size;i++)
{
array[i]=0;
}
}



 void put(int f,int no)
 {
if(f>=0&&f<=size-1)
{

array[f]=no;
}
else{
cout<<"execed size:";
}
 }

 int get(int no)
 {
if(no>=0&&no<=size-1)
{
int a=array[no];
cout<<a<<endl;
return a;
}
else
{
return 0;
}
 }

 void input()
 {
for(int i=0;i<size;i++)
{
cout<<"enter no";
cin>>array[i];
}
 }

 void output()
 {
for(int i=0;i<size;i++)
{
cout<<array[i]<<endl;
}
 }

 safe_array adding(safe_array a)
 {
safe_array b;
for(int i=0;i<size;i++)
{
  b.array[i]=a.array[i]+array[i];
}
return b;
 }



 int search_array(int a)
 {

    for(int i=0;i<=size;i++)
{
if(array[i]==a)
{
return i;

}
}
 }
 void sort_array()
 {
for(int i=0;i<=size;i++)
{
for(int j=0;j<=size-1;j++)
{
if(array[j+1]<array[j])
{
int temp=array[j];
array[j]=array[j+1];
array[j+1]=temp;
}
}
}
 }
};




int main()
{
safe_array arr,b,c;

char a;
do
{

cout<<"------------------------------------------"<<endl;
cout<<"enter 'A' for put in array:"<<endl;
cout<<"enter 'B' for get from array:"<<endl;
cout<<"enter 'C' for whole input:"<<endl;
cout<<"enter 'D' for whole display:"<<endl;
cout<<"enter 'E' for adding two objects:"<<endl;
cout<<"enter 'F' for search:"<<endl;
cout<<"enter 'G' for sort:"<<endl;
cout<<"enter 'I' for Exit:"<<endl;
cout<<"-----------------------------------------------"<<endl;

cout<<"enter choice:";
cin>>a;
switch (a)
{
case 'A':
          int n,k;
  cout<<"enter index=";
  cin>>k;
  cout<<"enter value=";
  cin>>n;
  arr.put(k,n);

break;

case 'B':
          int m;
  cout<<"enter index=";
  cin>>m;
  arr.get(m);
  
break;
case 'C':
arr.input();

break;
case 'D':
  arr.output();

break;
case 'E':
     
 b.input();
c= arr.adding(b);
c.output();
break;

case 'F':
int l,s;
cout<<"enter number for search";
cin>>l;
s=arr.search_array(l);
cout<<"number is at index:"<<s;
break;
case 'G':
arr.sort_array();

break;

}
}while(a!='I');

return 0;
}


Dear Readers if you have any query/question feel free to ask me via comment box given below. Also Follow us on social media site and share that post with your friends. - See more at: http://onlinecomputercafe.blogspot.com

useful tutorial keep it up...
EmoticonEmoticon

:)
:(
hihi
:-)
:D
=D
:-d
;(
;-(
@-)
:o
:>)
(o)
:p
:-?
(p)
:-s
8-)
:-t
:-b
b-(
(y)
x-)
(h)

LinkWithin