%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

%%%%%%%%%%%
%%%%%%%%%%%%%%%%%%%%%%%%% getting the max of an array %%%%%%%%%%%%%%%%%%%%%%%%%%
%%%%%%%%%%
#include <iostream>
using namespace std;
int main()
{
int
arr[6]={70,50,60,100,-10,15};
int max=arr[0];
for(int i=1;i<6;i++)
{
if(max<arr[i])
max=arr[i];
}
cout<<max;
return 0;
}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%%%%%%%%%%%
%%%%%%%%%%%%%%%%%%%%%%%%% selection sort algorithm %%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%%%%%%%%%%%
#include <iostream>
using namespace std;
int main()
{
int
arr[6]={70,50,60,100,-10,15},i,j,mini,temp;
for (j=0;j<5;j++)
{
mini=j;
for(i=j+1;i<6;i++)
{
if (arr[i]<arr[mini])
mini=i;
}
temp=arr[j];
arr[j]=arr[mini];
arr[mini]=temp;
for(i=0;i<6;i++)
cout<<arr[i]<<" ";
cout<<endl;
}
for(i=0;i<6;i++)
cout<<arr[i]<<" ";
return 0;
}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%****** prime generator ******* Still don't work ******* &&&&&*********%%%%%%%%
*************************************************
#include <iostream>
using namespace std;
int main() {
const int size=20;
int arr[size], i, j;
for (i=0;i<size;i++)

{
arr[i]=1;
}
for (i=2;i<size;i++)
{
if (arr[i]==1)
for (j=2;i*j<size;j++)
arr[i*j]=0;
}
for (i=2;i<size;i++)
{
if (arr[i]==1)
cout << i << endl;
}
return 0;
}%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%^^^^^^^^^&&&&&&&&&&***********%%
%%%%%
%%%%$$$$$$$$$$$$$$$$####################@@@@@@@@@@@@@@@@@%%%%%%%%%%^^^^^^^&&%%%%
%%%%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%%%
%****** prime checker ******* Still don't work ******* &&&&&*********%%%%%%%%%%
%%%%**********************************************
#include <iostream>
using namespace std;
int main() {
int N,i,isprime;
cout<<"enter the value of N \n";
cin>>N;
isprime=1;
for (i=2;i<N;i++)
{
if (N%i==0)
isprime=0;
}
if (isprime==1)
cout<<"prime";
else
cout<<"not prime";
return 0;
}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%
prime generator
#include <iostream>
using namespace std;
int main() {
int i,j,isprime;
isprime=1;
for (i=1;i<9;i++)
\\ changable num. is 9
{
for (j=2;j<i;j++)
if (i%j==0)
isprime=0;
if (isprime==1)
cout<<i<<"\n";

}
return 0;
}
&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&
&&&&&&&&&&&&&&&&&
#include <iostream>
using namespace std;
int main() {
const int size =4;
int arr[size],arrout[],level,i;
arr[size]=[1,2,3,4];
cout<<"Enter the level of transform 1,2 or 3";
cin>>level;
if (level == 1)
for (i=0;i<size-1;i++)
{
arrout[i] =arr[i] +arr[i+1];
i++
arrout[i+2]=arr[i+3]-arr[i+4];
i++
}
if (level ==2)
for (i=0;i<size/2;i++)
{
arrout[i] =arr[i] +arr[i+1];
i++
arrout[i+2]=arr[i+3]-arr[i+4];
i++
}
return 0;
}