#include<iostream> #include<map> #include<iterator> using namespace std; int main() { int arr[5]={12,3,4,3,3}; map<int,int>mp; int i=0; for(i=0;i<5;++i) { if(!(mp[arr[i]])) mp[arr[i]]=i; else continue; } map<int,int>::iterator it; for(it=mp.begin();it!=mp.end();++it) cout<<it->second<<endl; cin.sync(); cin.get(); return 0; }
On Sun, Jun 6, 2010 at 3:14 PM, divya jain <sweetdivya....@gmail.com> wrote: > @sharad > while storing each element in hash by your approach u ll check if its > already there in hash. so the complexity here will be O(n2). correct me if i > m wrong. isnt there ny better algo..? > > On 6 June 2010 06:28, sharad kumar <aryansmit3...@gmail.com> wrote: > >> @dhivya:keep storing the first occurance element index in hash map and >> then start insertin eleement ....based on index position >> >> >> On Sun, Jun 6, 2010 at 12:31 AM, divya <sweetdivya....@gmail.com> wrote: >> >>> Given an array with some repeating numbers. Like 12,6,5,12,6 >>> >>> output: 12,12,6,6,5 >>> 12 shud come before 6 since it is earlier in list. So cant use a >>> dictionary. >>> >>> -- >>> You received this message because you are subscribed to the Google Groups >>> "Algorithm Geeks" group. >>> To post to this group, send email to algoge...@googlegroups.com. >>> To unsubscribe from this group, send email to >>> algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> >>> . >>> For more options, visit this group at >>> http://groups.google.com/group/algogeeks?hl=en. >>> >>> >> >> >> -- >> yezhu malai vaasa venkataramana Govinda Govinda >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to algoge...@googlegroups.com. >> To unsubscribe from this group, send email to >> algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> >> . >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algoge...@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- yezhu malai vaasa venkataramana Govinda Govinda -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.