Example of ordering array (C++)

 #include <iostream>

#include <stdlib.h>

#include <time.h>

#define kk 24

using namespace std;

int *tab1; int *tab2; int *tab3; int *tab4; int *tab5; int *tab6;

int min_T(int a, int b, int c)

{

int d;

d=a;

if(d>=b)

d=b;

if(d>=c)

d=c;

return d;

}

int max_T(int a, int b, int c)

{

int d;

d=a;

if(d<=b)

d=b;

if(d<=c)

d=c;

return d;

}

int mid_T(int a, int b, int c)

{

int d=0;

if(a<=b && a>=c)

d=a;

if(a<=c && a>=b)

d=a;

if(b<=a && b>=c)

d=b;

if(b<=c && b>=a)

d=b;

if(c<=a && c>=b)

d=c;

if(c<=b && c>=a)

d=c;

return d;

}

int main()

{

int i;

srand(time(NULL));

tab1=new int[kk]; tab2=new int[kk]; tab3=new int[kk];

tab4=new int[kk]; tab5=new int[kk]; tab6=new int[kk];

        for(i=0;i<kk;i++)

{

tab1[i]=1+rand()%kk;

tab2[i]=1+rand()%kk;

tab3[i]=1+rand()%kk;

tab4[i]=min_T(tab1[i],tab2[i],tab3[i]);

tab5[i]=max_T(tab1[i],tab2[i],tab3[i]);

tab6[i]=mid_T(tab1[i],tab2[i],tab3[i]);

cout<<tab4[i]<<"-"<<tab6[i]<<"-"<<tab5[i]<<endl;

}

delete [] tab6; delete [] tab5; delete [] tab4;

delete [] tab3; delete [] tab2; delete [] tab1;

return 0;

}

C fprintf()

 #include <stdio.h>

#include <stdlib.h>

#include <time.h>

#include <math.h>

#define asize 30

int tab1[asize], tab2[asize], tab3[asize];

double sq1[asize], sq2[asize], sq3[asize];

int main()

{

int i,j;

FILE *f1,*f2,*f3;

srand(time(NULL));

for(i=0;i<asize;i++)

{

tab1[i]=rand()%asize+1;

tab2[i]=rand()%asize+1;

tab3[i]=rand()%asize+1;

if(tab1[i]>tab2[i])

        {

                      

                        j=tab1[i];

tab1[i]=tab2[i];

tab2[i]=j;

}

if(tab1[i]>tab3[i])

{

j=tab1[i];

tab1[i]=tab3[i];

tab3[i]=j;

}

if(tab3[i]<tab2[i])

{

j=tab1[i];

tab3[i]=tab2[i];

tab2[i]=j;

}

sq1[i]=sqrt(1.00*tab1[i]);

sq2[i]=sqrt(1.00*tab2[i]);

sq3[i]=sqrt(1.00*tab3[i]);

}

f1=fopen("MINVALUES.txt","wt");

for(i=0;i<asize;i++) {

fprintf(f1,"%d  %.2f\n",tab1[i],sq1[i]);

}

fclose(f1);

f2=fopen("MIDDLEVALUES.txt","wt");

for(i=0;i<asize;i++) {

fprintf(f2,"%d  %.2f\n",tab2[i],sq2[i]);

}

fclose(f2);

f3=fopen("MAXVALUES.txt","wt");

for(i=0;i<asize;i++) {

fprintf(f3,"%d  %.2f\n",tab3[i],sq3[i]);

}

return 0;

}

Testing Lazarus in Linux Ubuntu (Free Pascal)

 Lazarus is free and therefore seems like an interesting alternative.

function is_First(mvalue:Integer):Boolean;

var i,suma:Integer;

  begin

    suma:=0;

    for i:=1 to mvalue+1 do

    begin

      if mvalue mod i=0 then

      suma:=suma+1;

    end;

    if suma=2 then

    is_First:=True

    else

    is_First:=False;

  end;

function sum_Tab(tab: array of Integer; size:Integer): Integer;

var i,sum:Integer;

begin

 sum:=0;

 for i:=0 to size do

  sum:=sum+tab[i];

 sum_Tab:=sum;

end;

function min_Tab(tab: array of Integer; size: Integer): Integer;

var i,min: Integer;

begin

 min:=tab[0];

 for i:=1 to size do

 begin

   if min>tab[i] then

    min:=tab[i];

 end;

 min_Tab:=min;

end;

function max_Tab(tab: array of Integer; size: Integer): Integer;

var i,max: Integer;

begin

 max:=tab[0];

 for i:=1 to size do

 begin

   if max<tab[i] then

    max:=tab[i];

 end;

 max_Tab:=max;;

end;

function aver_Tab1(tab: array of Integer; size: Integer):Real;

  begin

   aver_Tab1:=(1.00*sum_Tab(tab,size))/(1.00*size);

  end;

function aver_Tab2(tab: array of Integer; size: Integer):Real;

begin

  aver_Tab2:=((1.00*min_Tab(tab,size))+(1.00*max_Tab(tab,size)))/2.00;

end;

{ TForm1 }

procedure TForm1.Button2Click(Sender: TObject);

begin

  Close;

end;

procedure TForm1.Button1Click(Sender: TObject);

var

  pascalsA: array of Integer;

  i,j,m1,m2,s:Integer;

  a1,a2: Real;

begin

 setLength(pascalsA,30);

 i:=0;

 j:=1;

 repeat

   if is_First(j) then

   begin

     pascalsA[i]:=j;

     i:=i+1;

   end ;

   j:=j+1;

 until i>30;

 for i:=0 to 29 do

 begin

   ListBox1.Items.Add(IntToStr(i+1)+') '+IntToStr(pascalsA[i]));

 end;

 m1:=min_Tab(pascalsA,29);

 m2:=max_Tab(pascalsA,29);

 s:=sum_Tab(pascalsA,29);

 a1:=aver_Tab1(pascalsA,29);

 a2:=aver_Tab2(pascalsA,29);

 Label6.Caption:=IntToStr(m1);

 Label7.Caption:=IntToStr(m2);

 Label8.Caption:=IntToStr(s);

 Label9.Caption:=FloatToStr(a1);

 Label10.Caption:=FloatToStr(a2);

end;

end.               

Double array (malloc/free)

 #include <stdio.h>

#include <stdlib.h>

#include <time.h>

#define mint 10

#define maxt 100

int **tab;

void my_Sort(int *t, int s);

void write_Date(char *file_Name, int **t, int x, int y);

int main(int argc, char **argv)

{

int i,j,k,l,m;

char *f_Name;

f_Name="DOUBLE_ARRAY";

srand(time(NULL));

i=mint+rand()%maxt;

j=mint+rand()%maxt;

tab=malloc(i*sizeof(int*));

for(k=0;k<i;k++)

tab[k]=malloc(j*sizeof(int));

for(k=0;k<i;k++)

{

for(l=0;l<j;l++)

{

m=mint+rand()%maxt;

tab[k][l]=m;

}

}

for(k=0;k<i;k++)

my_Sort(tab[k],j);

write_Date(f_Name,tab,i,j);

 

for(k=0;k<i;k++)

free(tab[k]);

free(tab);

return 0;

}

void my_Sort(int *t, int s)

{

int i,j,k;

for(i=1;i<s;i++)

{

j=i;

k=t[j];

while((j>0) && (t[j-1]>k))

{

t[j]=t[j-1];

j--;

}

t[j]=k;

}

}

void write_Date(char *file_Name, int **t, int x, int y)

{

FILE *f;

int i,j;

f=fopen(file_Name,"w");

for(i=0;i<x;i++)

{

for(j=0;j<y;j++)

{

fprintf(f,"%d   ",t[i][j]);

}

fprintf(f,"\n");

}

fclose(f);

}

Summing arrays [C++]

 #include <iostream>

using namespace std;

int A[4]={10,100,1000,10000};

int B[4]={20,200,2000,20000};

int C[4]={30,300,3000,30000};

int D[4]={40,400,4000,40000};

int E[4]={50,500,5000,50000};

int F[4]={60,600,6000,60000};

int G[4]={70,700,7000,70000};

int H[4]={80,800,8000,80000};

int I[4]={90,900,9000,90000};

int sa[4],sb[4],sc[4],sd[4],se[4],sf[4],sg[4],sh[4],si[4];

int k1,k2,k3,k4,k5,k6,k7,k8,k9;

int main(int argc, char **argv)

{

int i,j;

for(i=0;i<4;i++)

{

sa[i]=0;

sb[i]=0;

sc[i]=0;

sd[i]=0;

se[i]=0;

sf[i]=0;

sg[i]=0;

sh[i]=0;

si[i]=0;

}

for(j=0;j<4;j++)

{

for(k1=1;k1<A[j]+1;k1++)

sa[j]+=k1;

for(k2=1;k2<B[j]+1;k2++)

sb[j]+=k2;

for(k3=1;k3<C[j]+1;k3++)

sc[j]+=k3;

for(k4=1;k4<D[j]+1;k4++)

sd[j]+=k4;

for(k5=1;k5<E[j]+1;k5++)

se[j]+=k5;

for(k6=1;k6<F[j]+1;k6++)

sf[j]+=k6;

for(k7=1;k7<G[j]+1;k7++)

sg[j]+=k7;

for(k8=1;k8<H[j]+1;k8++)

sh[j]+=k8;

for(k9=1;k9<I[j]+1;k9++)

si[j]+=k9; 

}

for(i=0;i<4;i++)

{

cout<<sa[i]<<"   ";

}cout<<endl;

for(i=0;i<4;i++)

{

cout<<sb[i]<<"   ";

}cout<<endl;

for(i=0;i<4;i++)

{

cout<<sc[i]<<"   ";

}cout<<endl;

for(i=0;i<4;i++)

{

cout<<sd[i]<<"   ";

}cout<<endl;

for(i=0;i<4;i++)

{

cout<<se[i]<<"   ";

}cout<<endl;

for(i=0;i<4;i++)

{

cout<<sf[i]<<"   ";

}cout<<endl;

for(i=0;i<4;i++)

{

cout<<sg[i]<<"   ";

}cout<<endl;

for(i=0;i<4;i++)

{

cout<<sh[i]<<"   ";

}cout<<endl;

for(i=0;i<4;i++)

{

cout<<si[i]<<"   ";

}cout<<endl;

return 0;

}

Interesting dependencies:

55   5050   500500   50005000   

210   20100   2001000   200010000   

and

820   80200   8002000   800020000

The sides of right triangle (sorting) C

 #include <stdio.h>

#include <stdlib.h>

#include <time.h>

#define mm 20

#define max1 1000

int das1[mm],das2[mm],das3[mm];

int eas1[mm],eas2[mm],eas3[mm];

int temp[mm];

void sort_T(int* tab, int s)

{

int i,j,k;

for(i=1;i<s;i++)

{

j=i;

k=tab[j];

while((j>0) && (tab[j-1]>k))

{

tab[j]=tab[j-1];

j--;

}

tab[j]=k;

}

}

int main()

{

int a,b,c;

int i,j;

srand(time(NULL));

i=0;

do

{

a=1+rand()%1000;

b=1+rand()%1000;

c=1+rand()%1000;

if((a*a)+(b*b)==(c*c))

{

das1[i]=a;

das2[i]=b;

das3[i]=c;

eas3[i]=das3[i];

++i;

}

}while(i<mm);

sort_T(eas3,mm);

for(i=0;i<mm;i++)

{

for(j=0;j<mm;j++)

{

if(eas3[i]==das3[j])

temp[i]=j;

}

}

for(i=0;i<mm;i++)

{

eas1[i]=das1[temp[i]];

eas2[i]=das2[temp[i]];

}

printf("THE SIDES OF RIGHT TRIANGLE: \n");

for(j=0;j<mm;j++)

{

printf("%d  -  %d  = %d SORTING %d  - %d = %d \n",

das1[j],das2[j],das3[j],eas1[j],eas2[j],eas3[j]);

}

return 0;

}

Password generator (C)

 #include <stdio.h>

#include <stdlib.h>

#include <time.h>

#include <string.h>

char char_Sp[25]={'~','!','@','#','$','%','^','&','*','(',')','-','+','>','{','}',

':','|','<','?','`','[',']',';',',','.'};

char Numbers[10];

char LowL[26];

char UpperL[26];

void init_Tab()

{

char i1,i2;

int j;

j=0;

for(i1='0';i1<'9'+1;i1++)

{

Numbers[j]=i1;

++j;

}

j=0;

for(i1='a',i2='A';i1<'z'+1;i1++,i2++)

{

LowL[j]=i1;

UpperL[j]=i2;

++j;

}

 

}

char write_Char()

{

int i,j;

char c;

i=rand()%4;

switch(i)

{

case 0:

j=rand()%26;

c=char_Sp[j];

break;

case 1:

j=rand()%10;

c=Numbers[j];

break;

case 2:

j=rand()%26;

c=LowL[j];

break;

case 3:

j=rand()%26;

c=UpperL[j];

break;

default:

break;

}

return c;

}

int main(int argc, char **argv)

{

srand(time(NULL));

init_Tab();

char file_Name[20];

char **passwd,res;

FILE *my_FILE;

int pas,chr,i,j;

printf("How many passwdords ? : ");

scanf("%d", &pas);

printf("How many characters ? : ");

scanf("%d", &chr);

printf("File name (max 20) ? : ");

scanf("%s",file_Name);

passwd=(char**)malloc(pas*sizeof(char*));

for(i=0;i<pas;i++)

{

passwd[i]=malloc(chr*sizeof(char*));

}

for(i=0;i<pas;i++)

{

for(j=0;j<chr;j++)

{

res=write_Char();

passwd[i][j]=res;

}

}

my_FILE=fopen(file_Name,"w");

for(i=0;i<pas;i++)

{

fprintf(my_FILE,"%s \n",passwd[i]);

}

fclose(my_FILE);

for(i=0;i<pas;i++)

free(passwd[i]);

free(passwd);

return 0;

}