reversing

Why can't you just reverse the algorithm like you could reverse a math function? How is it possible to make an algorithm that isn't reversible? And if you use a rainbow table, what makes using a salt impossible to crack it? If you are making a rainbow table with brute force to generate it, then it invents each plaintext value possible (to a length), which would end up including the salt for each possible password and each possible salt (the salt and password/text would just come together as a single piece of text). Jeremy Salwen MD5 is designed to be cryptographically irreversible . In this

Possible Duplicate: Unable to reverse a linked list I'm trying to reverse a linked list: void LinkedList::reverseList() { Node *next=_head; Node *prev=0; while(next!=0) { Node *tmp=next->_next; next->_next=prev; prev=next; next=tmp; } } Lets say the list is: 4->3->2->1 When I print the list, I only see 1 (The print function is good). Any help? Thanks Since you said you wanted to find the problem on your own, I'll just give you a hint instead of the solution. Your reverse function works in that it successfully reverses the list. That isn't the problem. You probably have 2 calls to print . One