c++ Deleting duplicated Names in array - c++

Question

EDIT: Thank you so much everyone, songyuanyao Answered my question, and you guys did lol but i didnt know some codes u put and im sure soon i will learn them :) thanks again.
i really have a question about removing duplicated Names in a string, note that im fairly new to c++, anyways i'll get to the point.
what im trying to do is removing duplicated names in an array, the code below is working fine but here's what im facing.
For example i entered 4 names: (Hana, Alex, Hana, Alex) the results that i want to get is just : ( Hana and Alex) while the other 2 names should be removed yet what im getting is ( Hana , Alex, Alex).
im really confused about what should i do to fix this and i want it to check every name in the list, Thanks in advance :).
#include "stdafx.h"
#include <iostream>
#include <string>
using namespace std;
string nurse[4];
int i, n=3, j, k, num;
int main()
{
cout << "Please Enter names to add to the list --->";
for (i = 0; i <= n; i++)
{
cin >> nurse[i];
}
for (int i = 0; i < n; i++)
{
for (j = i + 1; j < n;)
if (nurse[j] == nurse[i])
{
for (k = j; k < n; k++)
{
nurse[k] = nurse[k + 1];
}
n--;
}
else
{
j++;
}
}
cout << "Printing list after removing duplicated names" << endl;
for (i = 0; i <= n; i++)
cout << " "<<nurse[i] << endl;
system("pause");
return 0;
}

Answer 1

#include <string>
#include <vector>
#include <algorithm>
using namespace std;
// ...
vector<string> nurses;
nurses.push_back("Hana");
nurses.push_back("Alex");
nurses.push_back("Hana");
nurses.push_back("Alex");
sort(nurses.begin(), nurses.end());
const vector<string>::iterator it = unique(nurses.begin(), nurses.end());
nurses.erase(it, nurses.end());

Answer 2

Say you start with
vector<string> v{"alex", "emma", "alex"};
Define an unordered_set with these items:
unordered_set<string> h;
Now use the erase-remove idiom using
[&h](const string &s){return !h.insert(s).second;};
This will do the job in (expected) linear time.
Full example:
#include <string>
#include<vector>
#include <unordered_set>
#include <algorithm>
using namespace std;
int main()
{
vector<string> v{"alex", "emma", "alex"};
unordered_set<string> h;
auto r = [&h](const string &s){return !h.insert(s).second;};
v.erase(remove_if(begin(v), end(v), r), end(v));
}

Answer 3

You condition in for is one less than the count of the elements, so the last element won't be checked at all.
for (int i = 0; i <= n; i++)
~
{
for (j = i + 1; j <= n;)
~
if (nurse[j] == nurse[i])
{
for (k = j; k <= n; k++)
~
{
nurse[k] = nurse[k + 1];
}
n--;
}
else
{
j++;
}
}

Answer 4

You are effectively not removing names from your array. You are just shifting them in case same name comes!
You could actually use a std::set which will automatically do this for you!
std::set< std::string > nurses;
std::string nurse;
for (i = 0; i <= n; i++)
{
std::cin >> nurse;
nurses.insert( nurse );
}
Do not forget to include <set> in your code.