Return to Question

It seems that my implementation is a lot slower than the library code. I don't know where I can save time.

It seems that my implementation is a lot slower than the library code. How can I improve performance of my code.

I have been experimenting around to generate all the n-combinations of an array. Below is the code to quickly generate all \$\text{k-combinations}\$ of a given array. I am testing my own implementation because of some restrictions in coding competitions (Also, knowing basics never hurts :)).

It seems that my implementation is lot slower than the library code, don't know where I can save time.

I have been experimenting around with generating all the n-combinations of an array. This code quickly generates all \$\text{k-combinations}\$ of a given array. I am testing my own implementation because of some restrictions in coding competitions (also, knowing the basics never hurts).

It seems that my implementation is a lot slower than the library code. I don't know where I can save time.