Whats the problem?
I used netbeans to build and run this. I builds successfully but when i give run it is not running. what's the problem? What mistake I made? Do I have to give input or something in the codes? Please help me. I'm not so good in programming, but i need to solve this.
Last edited by Bibin; 11-08-2012 at 01:00 AM.
Just so we're clear, you took the code from here -> http://svn.sdstrowes.co.uk/pub/longest-prefix/tree.c
> What mistake I made?
Downloading code you have no clue about
> Do I have to give input or something in the codes?
Apparently, yes.
> Please help me. I'm not so good in programming, but i need to solve this.
Solve what?
It seems to me that you googled for tree source code, and attached yourself limpet-style to the first one you found. You've no idea whether this particular implementation of tree solves your problem.
And we've no idea if this solves your problem, because you haven't told us what it is you're trying to solve.
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
yes i downloaded the code from that site. I didn't mean to hide it, that's why I didn't edit those introductions in the coding.
I want code for finding longest matching prefix inorder to solve the IP address lookup. I know the concept but I don't know coding. so I downloaded this code.
If u know tell me how to give input and get the output for this coding.
> If u know tell me how to give input and get the output for this coding.
This line seems to be a big give away.
fprintf(stderr, "Usage: %s -f prefix_file [-d]\n\n", name);
If you couldn't figure this out, how do you know the input format the program expects is the same as the input format you have?
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
