//**************************************
//     
// Name: REMOVE DUPLICATES IN ARRAY
// Description:A good method for removin
//     g duplicates in an array
COMMENTS INCLUDED
// By: Renjini S
//
// Inputs:Array elements
//
// Returns:array with duplicates removed
//     
//
// Assumes:Array should be in sorted ord
//     er
//
//This code is copyrighted and has// limited warranties.Please see http://
//     www.Planet-Source-Code.com/vb/scripts/Sh
//     owCode.asp?txtCodeId=7144&lngWId;=3//for details.//**************************************
//     

/*
A PROGRAM for REMOVING DUPLICATES FROM AN ARRAY AND THEREBY CONTRACTING THE ARRAY.
CONSECUTIVE ELEMENTS ARE COMPARED for EQUALITY.
INPUTS: ARRAY ELEMENTS
OUPUT: ARRAY WITH DUPLICATES REMOVED
ASSUMPTIONS: ARRAY SHOULD BE IN SORTED ORDER (ASCENDING)
SIDE EFFECTS: MAY NOT BE EFFICIENT for LARGE ARRAYS
VARIABLES USED:
	i : for array traversal
	j : for keeping track of distinct numbers
*/
#include <stdio.h>
#define ARRAYSIZE 10
void main()
    {
    int arr[ARRAYSIZE],i,j;
    printf("Enter the array elements\n");
    for(i=0;i<ARRAYSIZE;i++)
    scanf("%d",&arr;[i]);
    printf("Removing duplicates.....\n");
    i=1;//the position of arr[0] does not change
    while(arr[i-1]!=arr[i] && i<ARRAYSIZE)	//it is necessary to start shifting elements 
    i=i+1;					//only after the first duplicate is encountered. this is efficient
    						//when the array has no duplicates.
    if(i==ARRAYSIZE)//no duplicates
    j=i;
    else
        {
        j=i-1;
        while(i<ARRAYSIZE)
            {
            i=i+1;
            if(arr[i-1]!=arr[i])
                {
                j=j+1;
                arr[j]=arr[i];	//if there are j distinct elements, they should occupy postions from 0 to j-1			
            }

        }

    }

    printf("Array after removing duplicates.......");
    for(i=0;i<j;i++)
    printf(" %d",arr[i]);
    printf("\n");
}