Friday, 19.04.2024, 16:46
Welcome Guest | RSS
Site menu
Login form
Section categories
Search
Calendar
«  July 2011  »
SuMoTuWeThFrSa
     12
3456789
10111213141516
17181920212223
24252627282930
31
Entries archive
Our poll
Rate my site
Total of answers: 6
Statistics

Total online: 1
Guests: 1
Users: 0

Main » 2011 » July » 01
#include <iostream>
using namespace std;


int mul(int x, int y){

    return (x*y);
}

int main()
{
    int i, j;
    int a[10][10];
    for (i=0;i<10;i++){
    for (j=0;j<10;j++)
    a[i][j]=mul(i,j);
    }

 for (i=0;i<10;i++){
    cout<<endl;
    for (j=0;j<10;j++)
        cout<<i<<" * "<<j<<" = "<<a[i][j]<<endl;
            }
            return 0;
            }

Category: C++ programs | Views: 3728 | Added by: H_Imirzyan | Date: 01.07.2011 | Comments (0)

#include <cstdlib>
#include <iostream>


//Gnome Sort Algorithm


using namespace std;

//gnomeSort Function
void gnomeSort(int elements, int arr[])
{
    int i = 0, temp;

    while( i < elements ){

           if ( i == 0 || arr [i - 1] <= arr[i] )
              i++;

           else{
                temp = arr[i];
                arr[i] = arr[i - 1];
                arr[--i] = temp;
           }//end else

    }//en ... Read more »
Category: C++ programs | Views: 696 | Added by: H_Imirzyan | Date: 01.07.2011 | Comments (0)