void deleteDuplicates()
{
    int k,j;
  
    for(k=firstElement; k<=lastElement; k++) 
    {    
        //At each location, the two adjacent elements are compared
        if(GetTwentyLetters[k] == GetTwentyLetters[k+1])
        {
            // if elements are the same, then elements are moved down one position
            for(j=k;GetTwentyLetters[j];j++)
            {
                GetTwentyLetters[j] = GetTwentyLetters[j+1];
            }
        }
    }
}

void deleteDuplicates()
{
    int k,j;
  
    for(k=firstElement; k<=lastElement; k++) 
    {    
        //At each location, the two adjacent elements are compared
        while (GetTwentyLetters[k] == GetTwentyLetters[k+1] 
            && GetTwentyLetters[k])
        {
            // if elements are the same, then elements are moved down one position
            for(j=k;GetTwentyLetters[j];j++)
            {
                GetTwentyLetters[j] = GetTwentyLetters[j+1];
            }
        }
    }
}

for(j=k; j < lastElement; j++)

for(j=i; GetTwentyLetters[j]; j++)

#include <algorithm>
#include <fstream>
#include <iostream>
#include <string>
using namespace std;
 
#include <cctype>
 
// required for conversion to lowercase
class toLower {public: char operator()(char c) const {return tolower(c);}};
 
void sortNames(string* name, int nNames)
{
for (int i = 0; i < nNames; i++)
{
for (int j = i + 1; j < nNames; j++)
{
if (name[i] > name[j]) //start swap 
{
string temp = name[i];
name[i] = name[j];
name[j] = temp;
} //if
} // for j
} // for i
} // void sortNames
 
void printName(string* name, int nNames)
{
int i;
for (i = 0; i < nNames; i++) // print names greater than 0 length
{
if (name[i].length()!=0) cout << "Name = " << name[i] << endl;
} // for i
} // void printNames
 
void deleteDupes(string* name, int nNames)
{
int temp=0;
bool flag;
 
//For each pair of elements in the array do the following
for(int i=0; i< nNames-temp; ) // while we haven't reached the end of nNames
{ 
string aName=name[i]; // temp variable for first name
string bName=name[i+1]; // temp variable for next name
 
transform(aName.begin(), aName.end(), aName.begin(), toLower()); // make it lowercase to compare
transform(bName.begin(), bName.end(), bName.begin(), toLower());
 
flag=false;
//At each location, the two adjacent elements are compared
if(aName == bName)
{
flag=true;
temp++;
} 
 
if(flag) // if test is true
{
// if elements are the same, then elements are moved up one position
for(int j=i+1;j<=nNames-temp;j++)
{
name[j] = name[j+1]; // duplicate elminated
} //for 
} // if
else i++; // now move i counter
} // for
} // void deleteDupes
 
int main()
{
// create an empty list
const int MAX_NAMES = 100; // capacity
int nNames = 0; // initially empty
string name[MAX_NAMES];
 
// ask for filename and open for input
ifstream fin;
string fileName;
cout << "What file do you want to use for input? ";
getline(cin, fileName);
fin.open(fileName.c_str());
 
// read name from file
while (fin.good())
{
string aName;
getline(fin, aName);
 
// add record to list, if it's not full
if (nNames < MAX_NAMES && aName.length() > 0)
name[nNames++] = aName;
}
fin.close();
 
// sort the name alphabetically
sortNames(name, nNames);
 
// delete duplicate names
deleteDupes(name, nNames);
 
// print names
printName(name, nNames);
 
return 0;
} // main

//-----------------------------------------------------------------------------------
#include<iostream>
#include<vector>
#include<set>
 
using namespace std;
 
int main(){
vector<char> v;
v.push_back('D');
v.push_back('B');
v.push_back('A');
v.push_back('B');
 
set<char> s;
for(vector<char>::iterator it=v.begin();it!=v.end();it++){
cout << (*it) << endl;
s.insert((*it));
}
 
cout << "Removing duplicates" << endl;
for(set<char>::iterator it=s.begin();it!=s.end();it++)
cout << *it << endl;
}
//---------------------------------------------------------------------