C / C++ / MFC

int size,x,y,temp; // the diamont width      <br />
size=13;<br />
y=1;<br />
x=size/2; //x=6<br />
//draw the upper part<br />
for(i=0;i<=size-1;i+=2)<br />
{<br />
   temp=x;<br />
   for(j=0;j<=i;j++)<br />
   {<br />
       draw at x,y<br />
       x++; <br />
   }<br />
   x=temp--;<br />
   y++;<br />
}

<italic>Work hard, Work effectively and a bit of luck is the key to success.

PBS_MARQUEE 
Version 6.0 or later. The progress bar moves like a marquee.

"Opinions are neither right nor wrong. I cannot change your opinion. I can, however, change what influences your opinion." - David Crow

template<int i>
struct int_type
{
};
 
template<int i>
void foo(int_type<i>* dummy=0)
{
  printf("%i\n", i);
}
 
int main(int argc, char* argv[])
{
  foo<1>();
  foo<2>();
  return 0;
}

CClass *list[] = new CClass *[AmountOfPointers];
for (int i = 0; i < AmountOfPointers; i++) {
    list[i] = new CClass;
}

for (int i = 0; i < AmountOfPointers; i++) {
    delete list[i];
}
delete []list;

CClass **list = new CClass *[AmountOfPointers];<br />
for (idnum = 0; idnum < AmountOfPointers; idnum++) { list[idnum] = new CClass(idnum); }

CClass **list = new CClass *[AmountOfPointers];<br />
list[0] = new CClass(0);<br />
list[1] = new CClass(1);<br />
list[2] = new CClass(2);<br />
... etc ...

<br />
template < typename T ><br />
T **Allocate2DArray( int nRows, int nCols)<br />
{<br />
    T **ppi;<br />
    T *pool;<br />
    T *curPtr;<br />
    //(step 1) allocate memory for array of elements of column<br />
<br />
    ppi = new T*[nRows];<br />
<br />
    //(step 2) allocate memory for array of elements of each row<br />
    pool = new T [nRows * nCols];<br />
<br />
    // Now point the pointers in the right place<br />
    curPtr = pool;<br />
    for( int i = 0; i < nRows; i++)<br />
    {<br />
        *(ppi + i) = curPtr;<br />
         curPtr += nCols;<br />
    }<br />
    return ppi;<br />
}<br />
<br />
template < typename T ><br />
void Free2DArray(T** Array)<br />
{<br />
    delete [] *Array;<br />
    delete [] Array;<br />
}<br />
<br />
int main()<br />
{<br />
    double **d = Allocate2DArray<double>(10000, 10000);<br />
    d[0][0] = 10.0;<br />
    d[1][1] = 20.0;<br />
    d[9999][9999] = 2345.09;<br />
    Free2DArray(d);<br />
}<br />

list[]:
+-----+   +-----------+
| [0] |-->| CClass[0] |
+-----+   +-----------+
| [1] |-->| CClass[1] |
+-----+   +-----------+
| [2] |-->| CClass[2] |
+-----+   +-----------+
| [.] |-->| CClass[.] |
+-----+   +-----------+

   +-----------+
-->| CClass[0] |
   +-----------+
   | CClass[1] |
   +-----------+
   | CClass[2] |
   +-----------+
   | CClass[.] |
   +-----------+

CClass *list = (CClass *)malloc(sizeof(CClass) * AmountOfObjects);