Given an array of size N in which every number is between 1 and
N, determine if there are any duplicates in it. You are allowed
to destroy the array if you like. [ I ended up giving about 4 or
5 different solutions for this, each supposedly better than the
others ].
Answer Posted / sujan_faith
<!--i have just replaced the same array element with
the value zero but alse we can destroy that element-->>
#include<iostream>
#define size 10
using namespace std;
int main()
{
int a[10]={10,10,10,2,1,1,1,1,1,2};
int j=1;
for(int i=0;i<size;i++)
{
for(int k=i+1;k<size;k++)
{
if(a[i]==a[k]&&a[i]!=0)
{
a[k]=0;
j++;
}
if(k==(size-1)&& a[i]!=0)
cout<<"Value is: "<<a[i]<<" which is repeated "<<j<<" times"<<endl;
}
j=1;
}
system("pause");
}
| Is This Answer Correct ? | 8 Yes | 0 No |
Post New Answer View All Answers
What are the two types of comments, and how do they differ?
What do you understand by zombie objects in c++?
What is the c++ code?
Which recursive sorting technique always makes recursive calls to sort subarrays that are about half size of the original array?
Write an algorithm that determines whether or not an almost complete binary tree is a heap.
What is a base class?
What is the use of volatile variable?
What are the important differences between c++ and java?
how can i access a direct (absolute, not the offset) memory
address?
here is what i tried:
wrote a program that ask's for an address from the user,
creates a FAR pointer to that adress and shows it. then the
user can increment/decrement the value in that address by
pressing p(inc+) and m(dec-).
NOW, i compiled that program and opened it twice (in 2
different windows) and gave twice the same address to it.
now look what happen - if i change the value in
one "window" of the program, it DOES NOT change in the
other! even if they point to the same address in the memory!
here is the code snippet:
//------------------------------------------------------
#include How a modifier is similar to mutator? What is the use of vtable? What is flush c++? Can a function take variable length arguments, if yes, how? what are the iterator and generic algorithms. How does class accomplish data hiding in c++?