corrected the output for the example test case.

[KmrAnish04]

Have you read the Contributing Guidelines on Pull Requests?

(Write your answer here.)

Yes

Description

(Write your answer here.)

Checklist

• [x] I've read the contribution guidelines.
• [x] I've checked the issue list before deciding what to submit.
• [ ] I've edited the README.md and link to my code.

Related Issues or Pull Requests

(Write your answer here.)

Corrected the output for the example test case given in below in the solution file.

The previously written test case in the file was: / 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 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: 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

[github-actions[bot]]

Please reopen this pull request once you commit the changes requested or make improvements on the code. If this is not the case and you need some help, feel free to seek help from our Discord or ping one of the reviewers. Thank you for your contributions!