Comments on: Keep it simple, stupid. http://mipsisrisc.com/rambling/2007/03/06/keep-it-simple-stupid/ ...and other boring stuff. Fri, 09 Jan 2009 13:35:49 +0000 http://wordpress.org/?v=2.7 hourly 1 By: Geoff Greer http://mipsisrisc.com/rambling/2007/03/06/keep-it-simple-stupid/comment-page-1/#comment-510 Geoff Greer Sun, 23 Dec 2007 04:04:47 +0000 http://abughrai.be/rambling/?p=12#comment-510 I guess I should have been more descriptive. You can do a lot with singly linked lists, but seeking to a certain element, removing an arbitrary element, etc, are O(n) or higher. There are much better data structures if you're going to be doing those operations. I guess I should have been more descriptive. You can do a lot with singly linked lists, but seeking to a certain element, removing an arbitrary element, etc, are O(n) or higher. There are much better data structures if you’re going to be doing those operations.

]]> By: Kevin Lindeman http://mipsisrisc.com/rambling/2007/03/06/keep-it-simple-stupid/comment-page-1/#comment-508 Kevin Lindeman Sun, 16 Dec 2007 23:18:47 +0000 http://abughrai.be/rambling/?p=12#comment-508 I know this post is a bit old now, but I felt like I should comment on this. You can do way more than just that with a singly linked list. It isn't even that hard. It is easy to do things such as insert and remove in the middle of the list. The only reason you couldn't is if you were improperly taught linked lists by just letting you use a doubly-linked list, which is unnecessary in most cases. I can only think of two reasons for for needing a doubly-linked list is if you have a goToIndex(int i), and you want it to be fast and start from either end of the list depending on if the index is after the halfway point or not. Or if you want some sort of Java style Iterator where you want to be able to iterate using next() and then remove() would remove the last value given to you using next(). Just thought I should post that your class doesn't exactly do "about all you can with a singly linked list" ;) I know this post is a bit old now, but I felt like I should comment on this. You can do way more than just that with a singly linked list. It isn’t even that hard. It is easy to do things such as insert and remove in the middle of the list. The only reason you couldn’t is if you were improperly taught linked lists by just letting you use a doubly-linked list, which is unnecessary in most cases.

I can only think of two reasons for for needing a doubly-linked list is if you have a goToIndex(int i), and you want it to be fast and start from either end of the list depending on if the index is after the halfway point or not. Or if you want some sort of Java style Iterator where you want to be able to iterate using next() and then remove() would remove the last value given to you using next().

Just thought I should post that your class doesn’t exactly do “about all you can with a singly linked list” ;)

]]>