can anyone suggest some method to show all the permutation of a set of characters 1)recursively, and
2)non-recursively but using stack operation
and i can't use any pre-set function of C++
Type: Posts; User: kcfung
can anyone suggest some method to show all the permutation of a set of characters 1)recursively, and
2)non-recursively but using stack operation
and i can't use any pre-set function of C++
can anyone tell me what the main difference of these two programs is?
when i am trying the ACM problem 100, the first one is accepted but the second one is wrong.
and can you also tell me the...
In case of i don't know how many double numbers the users will input, can any one suggest a good way for me to read the input numbers?
i need to write a program to store a Matrix with dimentions...
I don't think so, i am only not allowed to allocate memory proportional to the list size and i even don't know the list size, and i can't modify the list , that is all
Thank you for your advise and i have make it. the assignment need me to do this task by two different methods, are there any other method you can suggest?
thanks
but i am not allow to allocate memory proportional to the list size, so i may not use that algorithm.
i need write a program to check if a list is acyclic, which means that a travel from any node in the list must not come back to the node itself.
a node is a struct type defined like that
struct...