- Upvotes Received
- 0
- Posts with Upvotes
- 0
- Upvoting Members
- 0
- Downvotes Received
- 1
- Posts with Downvotes
- 1
- Downvoting Members
- 1
7 Posted Topics
 | hi everyone..i really need help as fast as possible..i have 14 errors in the program..it is a linked list implementation for reversing a stack using recursion.. here is the code: [CODE]#include <iostream> using std::cin; using std::cout; using std::endl; #include<cstdlib> #include <fstream> using std::ifstream; using std::ofstream; #include"ItemType.h" using namespace std; struct …  |
| | hi everyone.. i need to ask 2 questions.. first..is the below code done using recursion or not? second..how can i make the below code take input from a text file instead of generating random numbers and make the output go to a new text file? [code=cplusplus] #include <iostream> using std::cin; … |
| | hi everyone.. i have a small problem with the below code.. when i execute the program, the output file doesnt print me the unsortedList.ReturnLastItem().Print(); it gives me the following output: the last item in the unsortedList is how can i make it print me the last item? here is the … |
| | hi everyone the program below is a function that should give the number of items greater than a number entered by a user.(unsorted list ADT) ex: input 3 unsorted list contains: 2 6 8 1 5 9 8 output should be 5 here is my try by there are alot …  |
| | THINK THIS IS THE ANSWER Using Stack [code]Traverse_reverse_order( ) { node *ptr, *stack; create_empty_stack (stack); ptr=head; while (ptr! =(node*) NULL) { push (stack, ptr); ptr=ptr->next; } while (! empty (stack)) { ptr=pop (stack); print ptr->info; } }[/code] Using Recursion [code]Traverse_reverse_order (node *ptr) { if (ptr! =(node*) NULL) Traverse_reverse_order (ptr->next) Print …  |
| | please help me write a function which will return the last element in an unsorted list. the prototype of the function should be ItemType ReturnLastItem(); we should assume that the list is not empty ans it shouldnt change after the program is executed.. pleeeeeeeeease help me  |
| | hi everyone..i need to crack a symmetric key by implementing a method called CrackSymmetricKey I must use the TEA encryption algorithm below: [CODE=c++] union myMsgType{ unsigned long textConverted[2]; char text[9]; }; class TEA_Algorithm { public: void CrackSymmetricKey(union myMsgType plaintext, union myMsgType ciphertext); void Decrypt(unsigned long k[], unsigned long ciphertext[], unsigned …  |