Re: [algogeeks] DISTINCT Permutations ( Not Easy)
This u can do it using the backtracking method. To know how to use backtracking refer algorithm design manual by steve skiena. On 7 January 2014 03:35, bujji jajala jajalabu...@gmail.com wrote: generate all possible DISTINCT permutations of a given string with some possible repeated characters. Use as minimal memory as possible. if given string contains n characters in total with m n distinct characters each occuring n_1, n_2, n_m times where n_1 + n_2 + ...+ n_m = n program should generate n! / ( n_1! * n_2! * * n_m! ) strings. Ex: aba is given string Output: aab aba baa -Thanks, Bujji -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com.
Re: [algogeeks] DISTINCT Permutations ( Not Easy)
This will help u i guess : #include iostream #include string.h using namespace std; void swap(char str[],int m,int n ) { char temp=str[m]; str[m]=str[n]; str[n]=temp; } bool duplicate(char str[], int start, int end) { if(start == end) return false; else for(; startend; start++) if (str[start] == str[end]) return true; return false; } void Permute(char str[], int start, int end) { if(start = end){ coutstrendl; return; } for(int i=start;i=end;i++) { if(!duplicate(str,start,i)) { swap(str,start,i); Permute(str,start+1,end); swap(str,start,i); } } } int main() { char Str[]=aba; Permute(Str,0,strlen(Str)-1); return 0; } NIshant Pandey Cell : 9911258345 Voice Mail : +91 124 451 2130 On Tue, Jan 7, 2014 at 4:44 PM, kumar raja rajkumar.cs...@gmail.com wrote: This u can do it using the backtracking method. To know how to use backtracking refer algorithm design manual by steve skiena. On 7 January 2014 03:35, bujji jajala jajalabu...@gmail.com wrote: generate all possible DISTINCT permutations of a given string with some possible repeated characters. Use as minimal memory as possible. if given string contains n characters in total with m n distinct characters each occuring n_1, n_2, n_m times where n_1 + n_2 + ...+ n_m = n program should generate n! / ( n_1! * n_2! * * n_m! ) strings. Ex: aba is given string Output: aab aba baa -Thanks, Bujji -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com.
[algogeeks] Job Openings at Adobe India
Hi all, *Adobe Hiring drive in Hyderabad, Noida and Bangalore* Dates: 18th/25th Jan 2014 Profile: *Developer* (C++/Java). Colleges Eligible: Premiere Institutes (IITs/NITs/IISc/BITS/IIITs/NSIT/Thapar/DCE/Jadavpur etc.) Experience Reqd : 1 – 5 Yrs experience in a good Product Company. Please share your resumes with me. -- Lalit Sharma | Member of Technical Staff | Adobe Systems ,Noida , India | Contact No : +91-8130-321-181 . -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com.
Re: [algogeeks] DISTINCT Permutations ( Not Easy)
use C++, next_permutation, in algorithm 2014/1/7 Nishant Pandey nishant.bits.me...@gmail.com This will help u i guess : #include iostream #include string.h using namespace std; void swap(char str[],int m,int n ) { char temp=str[m]; str[m]=str[n]; str[n]=temp; } bool duplicate(char str[], int start, int end) { if(start == end) return false; else for(; startend; start++) if (str[start] == str[end]) return true; return false; } void Permute(char str[], int start, int end) { if(start = end){ coutstrendl; return; } for(int i=start;i=end;i++) { if(!duplicate(str,start,i)) { swap(str,start,i); Permute(str,start+1,end); swap(str,start,i); } } } int main() { char Str[]=aba; Permute(Str,0,strlen(Str)-1); return 0; } NIshant Pandey Cell : 9911258345 Voice Mail : +91 124 451 2130 On Tue, Jan 7, 2014 at 4:44 PM, kumar raja rajkumar.cs...@gmail.comwrote: This u can do it using the backtracking method. To know how to use backtracking refer algorithm design manual by steve skiena. On 7 January 2014 03:35, bujji jajala jajalabu...@gmail.com wrote: generate all possible DISTINCT permutations of a given string with some possible repeated characters. Use as minimal memory as possible. if given string contains n characters in total with m n distinct characters each occuring n_1, n_2, n_m times where n_1 + n_2 + ...+ n_m = n program should generate n! / ( n_1! * n_2! * * n_m! ) strings. Ex: aba is given string Output: aab aba baa -Thanks, Bujji -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com. -- Victor Manuel Grijalva Altamirano Universidad Tecnologica de La Mixteca -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com.