I want some logic which will insert numbers in the array, and at the same time it will check that the current number is already not present in the array. Please help me with the logic.
-
1Show your effort.msc– msc2017-07-06 05:31:22 +00:00Commented Jul 6, 2017 at 5:31
-
2What have you tried so far? How have your attempt worked, or not worked? Please take some time to read the help pages, especially the sections named "What topics can I ask about here?" and "What types of questions should I avoid asking?". Also read about how to ask good questions. Lastly please learn how to create a Minimal, Complete, and Verifiable Example.Some programmer dude– Some programmer dude2017-07-06 05:31:44 +00:00Commented Jul 6, 2017 at 5:31
-
studytonight.com/c/remove-duplicate-element-program.phpmsc– msc2017-07-06 05:32:31 +00:00Commented Jul 6, 2017 at 5:32
-
It seems you need the OrderedSet rather than Array.ShenLei– ShenLei2017-07-06 05:32:40 +00:00Commented Jul 6, 2017 at 5:32
-
@ShenLei Why not an unordered set?Some programmer dude– Some programmer dude2017-07-06 05:33:46 +00:00Commented Jul 6, 2017 at 5:33
|
Show 1 more comment
2 Answers
Code to Remove duplicate Element in an Array
#include<stdio.h>
#include<conio.h>
void main()
{
int a[20], i, j, k, n;
clrscr();
printf("\nEnter array size : ");
scanf("%d",&n);
printf("\nEnter %d array element : ", n);
for(i = 0; i < n; i++)
{
scanf("%d",&a[i]);
}
printf("\nOriginal array is : ");
for(i=0;i< n;i++)
{
printf(" %d",a[i]);
}
printf("\nNew array is : ");
for(i=0; i < n; i++)
{
for(j=i+1; j < n; )
{
if(a[j] == a[i])
{
for(k=j; k < n;k++)
{
a[k] = a[k+1];
}
n--;
}
else {
j++;
}
}
}
for(i=0; i < n; i++)
{
printf("%d ", a[i]);
}
getch();
}
Output
Enter array size : 5
Enter 5 array element : 11 13 11 12 13
Original array is : 11 13 11 12 13
New array is : 11 13 12
Comments
Possible solution:
O(n^2)algorithm, where you do a linear searchO(n)to check if the number is present in the array or not for all thenelements.
For each element (n elements):
O(n): Search
O(1): Insertion
O(n^2)algorithm, when you insert in sorted array.
For each element (n elements):
O(log n): Binary search
O(n): Shift and Insertion
Though there are advanced data structures (more in C++ STL) but you will need more than just a array. Because insertion is costly in array(Insertion in a specific position).
Other data structures which might help: BST (AVL-BST, Splay Trees, ... other balanced Trees structures).
In C++: sets is exactly what you want. sets is implemented as tree in STL.
