i guess....complexity would be O(2^n) no output for 5 and 9 On Thu, Jan 19, 2012 at 3:59 PM, ADITYA KUMAR <[email protected]> wrote:
> thats a brute force solution... > can u expalin the complexity..i think its O(n^2) > and also there exist no solution for n < 3 > > > On Thu, Jan 19, 2012 at 3:36 PM, bharat b <[email protected]>wrote: > >> @Neeraj : will u pls explain u'r logic ... >> >> On 1/19/12, NEERAJ KODDHAN <[email protected]> wrote: >> > int[] a = new int[2*n]; >> > put(a, n); >> > >> > static void put(int[] a,int i){ >> > if(i>0){ >> > for(int j=0;j<a.length-i-1;j++){ >> > if(a[j]==0 && a[j+i+1]==0){ >> > a[j]=i; >> > a[j+i+1]=i; >> > put(a, i-1); >> > a[j]=0; >> > a[j+i+1]=0; >> > } >> > } >> > }else if(i==0){ >> > for (int k : a) { >> > System.out.print(k +" "); >> > } >> > System.out.println(); >> > } >> > } >> > >> > >> > On Wed, Jan 18, 2012 at 10:04 PM, Coding Geek <[email protected] >> >wrote: >> > >> >> Place N number from 1 to N, in 2N positions in such a way so that there >> >> are >> >> >> >> Exactly “n” number of cells between two placed locations of number “n”. >> >> Write a program to display numbers placed in this way. >> >> >> >> Example:- >> >> >> >> (1) One of the possible placement for 7 numbers in 14 positions is : >> >> 5 7 2 3 6 2 5 3 4 7 1 6 1 4 >> >> >> >> >> >> >> >> -- >> >> >> >> "To Iterate is Human, To Recurse is Divine" >> >> >> >> -- >> >> You received this message because you are subscribed to the Google >> Groups >> >> "Algorithm Geeks" group. >> >> To post to this group, send email to [email protected]. >> >> To unsubscribe from this group, send email to >> >> [email protected]. >> >> 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 [email protected]. >> > To unsubscribe from this group, send email to >> > [email protected]. >> > For more options, visit this group at >> > http://groups.google.com/group/algogeeks?hl=en. >> > >> > >> >> >> -- >> >> >> **Regards >> * >> * <[email protected]> >> >> Bharat B | M.Tech II | Computer Science & Engineering | IITM >> * >> * >> *Ph: +91 8056127652* >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to [email protected]. >> To unsubscribe from this group, send email to >> [email protected]. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> >> > > > -- > Regards > Aditya Kumar > B-tech IV year > Computer Science & Engg. > MNNIT, Allahabad. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > 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 [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
