void main()
{
	int a[15],i,b;
	void unique(int[],int);
	printf("enter the array elements");
	for(i=0;i<15;i++)
	scanf("%d",&a[i]);
	clrscr();
	b=a[0];
	printf("%d",b);
	unique(a,b);
	getch();
}
void unique(int a[],int start)
{
	int b,i;
	b=start;
	for(i=0;i<15;i++)
	{
		if(a[i]!=b)
		{	
			b=a[i];
			printf("%d",b);
		}
	}
}

#include<stdio.h>
#include<conio.h>
int getarray(int p[100], int n)
{
  int c, i = 1;
  for (c=1; c <n; )
    if (p[c] != p[i-1])
    {
      p[i] = p[c];
      c++;
      i++;
    } else
      c++;
return i;
}
main()
{
int a[100],n,i,j;
printf("enter n:");
scanf("%d",&n);
printf("enter elements:");
for(i=0;i<n;i++)
scanf("%d",&a[i]);
j=getarray(a,n);
printf("new array is:");
for(i=0;i<j;i++)
printf("\t%d",a[i]);
getch();
return 0;
}

private int[] GetUniqueList(int[] A)
        {
           
            if(A == null ) return null;
            List<int> result = new List<int>();
            for(int i=0;i<A.Length-1;i++)
            {
                if (A[i] != A[i + 1]) result.Add(A[i]);
            }
            if(A.Length>0)
                result.Add(A[A.Length-1]);
            return result.ToArray();
        }

didn't find the posts good enough, was looking for a very 
structured code, professional:

<CODE>
{
	int i, j, iLen;
	char *sTmpStr;

	iLen = (int) strlen(sStr);
	sTmpStr = (char *)malloc(sizeof(char) * iLen);

	for(i = 0;i < iLen; i++)
		sTmpStr[i] = sStr[i];

	for(i = 0, j = iLen - 1; i < iLen/2; i++, j--)
		sStr[i] = sTmpStr[j];
	free(sTmpStr);
	return;
}


int main()
{
	char sStr1[] = {"This is an awful string"};
	char sStr2[] = {"This is a K...O...O...L string"};

	printf("String 1: %s\n", sStr1);
	StrRevNoTempVar(sStr1);
	printf("String 1 Rev: %s\n", sStr1);

	printf("String 2: %s\n", sStr2);
	StrRevNoTempVar(sStr2);
	printf("String 2 Rev: %s\n", sStr2);

	return 0;
}
</CODE>

Crap <Posted Wrong Piece>, excuse.

<CODE>
// Write, efficient code for extracting unique elements 
from a sorted list of array.
// e.g. (1, 1, 3, 3, 3, 5, 5, 5, 9, 9, 9, 9) -> (1, 3, 5, 
9).

#include <stdio.h>


void RemoveDumInSortedList(int *iArr, int iSize)
{
	int i, j, k, iCurrNo = 0;

	for(i = 0, j = i + 1; j < iSize;)
	{
		
		if(iArr[j] == iArr[i])
		{
			j++;
		}
		else
		{
			iArr[++i] = iArr[j];
			j++;
		}
	}
	
	for(j = 0; j <= i; j++)
		printf("ARRAY[%d] = %d\n", j, iArr[j]);
}


int main()
{
	int iArr1[] = {1, 1, 3, 3, 3, 5, 5, 5, 9};
	int iArr2[] = {1, 2, 2, 3, 4, 5, 5};

	RemoveDumInSortedList(iArr2, sizeof(iArr2)/sizeof
(int));

	return 0;
}
</CODE>

/* Using the same array and no extra storage space*/
/* "Nothing's far when one wants to get there." */

#include<stdio.h>

main()
{
	int a[] = {1, 1, 3, 3, 3, 5, 5, 5, 9, 9, 9,10};
	int cur = 0;
	int i = 0;

	for (i = 1 ; i < (sizeof(a)/4) ;i++)
	{	
		if ( a[cur] != a[i])
		{
			 ++cur;
			 if (cur != i)
			 {
				 a[cur] = a[i];
			 }
		}
	}
	a[++cur] = '\0';
	for (i =0 ; i< cur;i++)
		printf ("%d\n",a[i]);
}

#include<stdio.h>
       main(){
           int a[10],start,i,c=1;
           clrscr();
           printf(" Enter ten elements in sorted order : ");
           for (i=0 ; i<10 ; i++){
                   scanf("%d",&a[i]);
           }
      
          start = a[0];
          for (i=1 ; i<10 ; i++){
                  if (start == a[i]){
                          c++;  // we can eliminate 
variable c using only index of array
                  }else{
                          printf(" %d no %d times 
present",start,c);
                          start = a[i];
                          c=1;
                  }
          }
          getch();
      }

main ()
{

  int a[] = { 1, 1, 3, 3, 3, 5, 5, 5, 9, 9, 9, 9 };
  int i = 0, key;
  int size;

  size = sizeof (a) / sizeof (int);
  key = a[i];

  for (; i < size; i++)
  {
    if (key != a[i])
    {
    printf ("\n %d", a[i]);
    key=a[i];
    }
  }
}