lhk_mgtf2008

I would like to write a program where can do permutation by using recursive technique...

problem is i have more 100 data

1,2,3,4....................................100,101,102

then to get all permutation result, i think i have to wait very very very very ................................................ long tim e

so would like to ask ...izit have any way that can shorted the time atleast in one day lo....pls
your helping i appreciate

DaWei

Although recursive operations take some additional time because of function call overhead, they more commonly fail because of other resource deficiencies (stack available, etc.). The first shot at decreasing time used is to make absolutely sure your algorithm is the best possible. Optimizing for performance is usually not approached correctly by the inexperienced or uninitiated. One needs to measure or profile the code to see where it's REALLY spending most of its time. I would recommend you read this link before proceeding.

__________________
Abstraction doesn't make it impossible to write bad code; it makes it possible to write superior code.
Contributor's Corner: Grumpy on C++ Exceptions DaWei on Pointers

lhk_mgtf2008

Thanx for ur advise, i read all about the link...

ACtually this not i want to do, but i need to need this becuase of my job, i m trainee in a company, i requested to do this program. although i had tell that is impossible to get the result so fast but supervisor try first befor give up..!!!!! if like that , then i think ...... hai~~~~ waiting to die...