Address Calculation

Address Calculation

An array S[30][20] is stored  in the memory along the row with each of the elements occupying 4 bytes. Find out the base address, if an element S[15][10] is stored at the memory location 7200.

Address Calculation

Address Calculation

Address Calculation

Selection Sort

Take an array as input and sort it in ascending order by selection sort :-

#include<iostream.h>
#include<conio.h>

void main()
 {
    int a['z'],size,small,tmp;
      cout<<"\nEnter Size of Array : ";
      cin>>size;
      for(int i=0;i<size;i++)
       {
          cout<<"\nEnter Element "<<(i+1)<<" : ";
            cin>>a[i];
         }
      for(int i=0;i<size;i++)
       {
          small=a[i];
            for(int j=i+1;j<size;j++)
             {
                if(small>a[j])
                   {
                      small = a[j];
                        tmp=a[i];
                        a[i]=a[j];
                        a[j]=tmp;
                     }
               }
         }
      cout<<"Array after Sorting is \n";
      for(int i=0;i<size;i++)
       {
          cout<<"\nElement "<<(i+1)<<" : "<<a[i];

         }
      getch();
   }

Take an array as input and to find maximum and minimum term in it :-

#include<iostream.h>
#include<conio.h>

void main()
 {
    int a['z'],size,max,min;
      cout<<"Enter size of 1-D array :\n";
      cin>>size;
      for(int i=0;i< size; i++)
       {
          cout<<"\nEnter element "<<(i+1)<<" : ";
            cin>>a[i];
         }
      max=a[0];
      min=a[0];
      for(int i=0;i<size; i++)
       {
          if(max<a[i])
             {
                max=a[i];
               }
            if(min>a[i])
             {
                min=a[i];
               }
         }
      cout<<"\nMaximum number is : "<<max;
      cout<<"\nMinimum number is : "<<min;
      getch();
   }

Bubble Sort

Take an array as input and sort it in ascending order by Bubble Sort :-

#include<iostream.h>
#include<conio.h>

void main()
 {
    int a['z'],size;
      cout<<"\nEnter Size of Array : ";
      cin>>size;
      for(int i=0;i<size;i++)
       {
          cout<<"\nEnter Element "<<(i+1)<<" : ";
            cin>>a[i];
         }
      for(int i=0;i<=size;i++)
       {
          for(int j=0;j<size-1;j++)
             {
                if(a[j]>a[j+1])
                   {
                      int tmp=a[j];
                        a[j]=a[j+1];
                        a[j+1]=tmp;
                     }
               }
         }
      cout<<"Array after Sorting is \n";
      for(int i=0;i<size;i++)
       {
          cout<<"\nElement "<<(i+1)<<" : "<<a[i];

         }
      getch();
   }