Need to correct the example test case output written in the down of the NextPermutation problelm.

[KmrAnish04]

💥 Proposal

Need to correct the example test case output written in the down of the question file named NextPermutation having path "C-Plus-Plus/cp/NextPermutation.cpp"

(Write your answer here.) Currently written test case in the file is: / Input : 6 5 3 4 9 7 6 Output : 6 5 3 4 9 7 6 Time Complexity : O(nlogn) Space Complexity : O(n) /

Changes need to be done: / Input : 6 5 3 4 9 7 6 Output : 5 3 6 4 7 9 Time Complexity : O(nlogn) Space Complexity : O(n) /

Explanation:

1. Test case: According to the algorithm written in the file, for the test case: 6 5 3 4 9 7 6

   The correct output is: 5 3 6 4 7 9

2. Here the space complexity is already correct. No need to change space complexity.

[github-actions[bot]]

Hello @KmrAnish04,
Thank you for opening an issue. :partying_face:
To get assigned to this particular issue please use /assign
Check this guide before contributing.

[KmrAnish04]

/assign

[github-actions[bot]]

This issue has been assigned to @KmrAnish04! It will become unassigned if it isn't closed within 12 days. A maintainer can also add the pinned label to prevent it from being unassigned.

[Ash-KODES]

is this issue closed? there are no PR?

[KmrAnish04]

here is the PR id = #7539 for this issue. @Ash-KODES

[github-actions[bot]]

@KmrAnish04, this issue hasn't had any activity in 5 days. It will become unassigned in 7 days to make room for someone else to contribute.

[github-actions[bot]]

Please reopen this issue once you add more information and updates here. If this is not the case and you need some help, feel free to seek help from our Telegram or ping one of the reviewers. Thank you for your contributions!