Use of a Simple Void Function 

Some basic understanding to use functions:

Other types of outputs:

without argument

Many of you has question in your mind that how to declare and define Pointer to Array in C++.

I 'll show how?

#include <iostream>

#include <conio.h>




using namespace std;




void main()

{

//int pointer to array declaration.

int *pointer_array[10];

//defining pointer to array.

 for(int i=0; i<100; i++)

 {

 pointer_array[i] = new int[5];

 for (int j=0; j<5; j++)

 pointer_array[i][j] = -1;

 } 

 getch();

}

In computer science, selection sort is a sorting algorithm, specifically an in-place comparison sort. It has O(n²) time complexity.
The algorithm divides the input list into two parts: the sublist of items already sorted, which is built up from left to right at the front (left) of the list, and the sublist of items remaining to be sorted that occupy the rest of the list. Initially, the sorted sublist is empty and the unsorted sublist is the entire input list. The algorithm proceeds by finding the smallest (or largest, depending on sorting order) element in the unsorted sublist, exchanging it with the leftmost unsorted element (putting it in sorted order), and moving the sublist boundaries one element to the right.
For more detail use Wiki... Selection Sort

#include <iostream>
#incl

ude <conio.h>

using namespace std;//Selection Sort Function



void Ssort(int *a,int length)

{



int temp;

for(int i=length-1;i>0;i--)

{

int first=0;

for(int j=1;j<=i;j++)

if(a[j]>a[first])first=j; temp=a[first];a[first]=a[i];a[i]=temp;}

}



void main()

{



int arr[10];

int temp[10];

arr[0]=100;

arr[1]=33;

arr[2]=43;

arr[3]=26;

arr[4]=46;

arr[5]=88;

arr[6]=52;

arr[7]=17;

arr[8]=53;

arr[9]=77;



for(int i=0;i<10;i++)

{

temp[i]=arr[i];

cout<<arr[i]<<",";

}



//calling selection sort function

Ssort(temp,10);



//Displaying the result.

cout<<endl<<endl;



for(int i=0;i<10;i++)

cout<<temp[i]<<",";

getch();

}

//code by http://CppQA.blogspot.com
//we are community of developers focusing on help for new programmers
#include <iostream>
using namespace std;
#define CHAR_BIT 8

/*Function to find minimum of x and y*/
int min(int x, int y)
{
  return  x + ((y - x) & ((y - x) >>
            (sizeof(int) * CHAR_BIT - 1)));
}

/* Function to find minimum of 3 numbers x, y and z*/
int smallest(int x, int y, int z)
{
    return min(x, min(y, z));
}

int main()
{
   int x = 1, y = 100, z = 90;
   cout << "Minimum of 3 numbers is " << smallest(x, y, z) << endl<<"http://CppQA.blogspot.com"<<endl;
   return 0;
}

you can fork this code on ideone.com

Swapping means to interchange values of usually two variables and is done using third temp variable e.g.

int var1 = 10, var2 = 20;
int temp = var2;
var2 = var1;
var1 = temp;
//now var1 = 20 and var2 = 10
//hence values have been swapped

But take a look at code swapping without use of third variable, this trick will come handy in future assignments

int var1 = 10, var2 = 20;
var1 = var1 * var2;
var2 = var1 / var2;
var1 = var1 / var2;
//now var1 = 20 and var2 = 10
//hence values have been swapped

For the person who can explain this code to me and post a solution using (^) operator, there is a GENUINE MICROSOFT VISUAL STUDIO KEY ;)
You can post a request for guest post in comments, anywhere

#include <iostream>
using namespace std;
#define CHAR_BIT 8

/*Function to find minimum of x and y*/
int min(int x, int y)
{
  return  y + ((x - y) & ((x - y) >>
            (sizeof(int) * CHAR_BIT - 1)));
}

/* Function to find minimum of 3 numbers x, y and z*/
int smallest(int x, int y, int z)
{
    return min(x, min(y, z));
}

int main()
{
   int x = 12, y = 15, z = 5;
   cout << "Minimum of 3 numbers is " << smallest(x, y, z) << endl;
   return 0;
}

(Continued From Special Diamonds Part 1) Part 2; Here will use 2 loops inside one loop so that it is easy to print shape in less loops and coding; It is simple because the loop we used for triangle in first page is going to be repeated in this loop only we will change the size alignment of shapes upside down;

A post by Usman of BESE 19 at MCS.

The simple program logic for Diamond printing program:

Part 1;

int i,j,rows,size;
cin>>rows;     //take input
size = rows;     //give the initial size of shape which is decreasing
size = 1;      //if shape is increasing then size is 1
do      //it will run row’s * time
{ j=size;      //it will change size of rows constantly
           do     //this loop is always as this format whatever shape is decreasing or increasing as it has to print a line of given width anywhere required
 {
                        cout<<”required character”; // do not put endl here as it is a continues line
                               j--;
               } while (j < size);
size--;     //if size of shape is decreasing downwards
size++;    //if size of shape is increasing downwards
cout<<endl; 
}while (i<given rows);

Please visit next part at Special Diamonds Part 2