Create Permutaion_by_decrese_conquer.c#4
Open
sspeedy99 wants to merge 1 commit intorafi007akhtar:masterfrom
Open
Create Permutaion_by_decrese_conquer.c#4sspeedy99 wants to merge 1 commit intorafi007akhtar:masterfrom
sspeedy99 wants to merge 1 commit intorafi007akhtar:masterfrom
Conversation
/* Uses the definition of n! to generate the permutations. Idea: ----- Remove each item from the given n items one at a time and append it to remaining (n-1)! permutations. Efficiency: ----------- O(n!) and as well we have expensive swaps Strategy used: -------------- Decrease and Conquer(decrease by 1) */
Owner
|
Hi, please add an example input and output test case in the comments on top. And rename the file with corrected spellings if possible. |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
/*
Uses the definition of n! to generate the permutations.
Idea:
Remove each item from the given n items one at a time and
append it to remaining (n-1)! permutations.
Efficiency:
O(n!) and as well we have expensive swaps
Strategy used:
Decrease and Conquer(decrease by 1)
*/