All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Algorithms
Lost my pointer! (Posted on 2003-11-24) Difficulty: 3 of 5
You have a SINGLY linked list in memory of at least 1000 nodes (perhaps many more). I give you a pointer to ONE of the elements. (You don't know to which one.)

Upon examination, you discover that the pointer to the next node is not NULL (indicating that we're not at the last node in the list).

Your mission, should you decide to accept it, is to delete the current node, and maintain the valid linked list.

First, how do you go about doing that?

Second, how do you go about doing that in fixed space (i.e., you have only 64 bytes of memory as scratch space, so you can't replicate the rest of the linked list in memory, nor store more than 16 4-byte pointers)?

See The Solution Submitted by SilverKnight    
Rating: 2.0000 (5 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
re: me very confused | Comment 5 of 16 |
(In reply to me very confused by Victor Zapana)

I could, but introduction to computer algorithms and data structures are generally one or two college-level courses.

If you are interested in the problem, I will suggest that you purchase any decent college text on data structures or do a lot of research online.

Here is a link to get you started.

- SK
  Posted by SilverKnight on 2003-11-24 17:27:19

Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (21)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information