• Post Reply Bookmark Topic Watch Topic
  • New Topic

Algorithm complexity and Big O - need suggestions for understanding this  RSS feed

 
William Barnes
Ranch Hand
Posts: 1049
2
IntelliJ IDE Java Spring
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
Never learned about this in school, never needed it on the job, and getting killed in interviews because of that. 

I need web page or book which explains this in very simple terms, hopefully without any math.  Pictures would be nice. 

Some one suggested Data Structures and Algorithms by by Aho, Hopcroft, and Ullmann.  Expensive new, maybe I can find a used one.

Most likely there is a better forum for this post, but wasn't able to find it.
 
William Ng
Greenhorn
Posts: 16
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
In school? You mean you went through a cs degree program without once being being asked how long an sort routine would take if you somehow needed to sort a trillion items vs sorting just 100, or maybe just one, or why nested for loops are a bad thing,, or that binary trees are amazing? If this is true, then that institution should be banned from teach cs.

You just do a quick google search: Algorithm complexity.
That should turn up some sufficient resources to help you.

The basis are not that hard. The real stuff that you probably don't need for interviews involve a quite a bit of math. The basics are just general concepts that involve a bit of arithmetic and algebra level math. You can probably avoid the math and just learn the basics.
 
Junilu Lacar
Sheriff
Posts: 11477
180
Android Debian Eclipse IDE IntelliJ IDE Java Linux Mac Spring Ubuntu
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
You can find the Aho book online, a quick search is all it takes.

Wikipedia has a pretty decent article on Big-O Notation - you could also search for a simple guide on Big O

You know, when I interview people for a job, one deal-breaker is when they don't know how to use Google to find information they'll need to do their jobs... it's a basic skill everybody should learn. Just sayin'...
 
William Ng
Greenhorn
Posts: 16
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
Junilu Lacar wrote:You can find the Aho book online, a quick search is all it takes.

Wikipedia has a pretty decent article on Big-O Notation - you could also search for a simple guide on Big O

You know, when I interview people for a job, one deal-breaker is when they don't know how to use Google to find information they'll need to do their jobs... it's a basic skill everybody should learn. Just sayin'...


A good programmer is resourceful programmer. And the best and easiest resource available is the Internet.
 
William Barnes
Ranch Hand
Posts: 1049
2
IntelliJ IDE Java Spring
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
With the exception of this

> You just do a quick google search: Algorithm complexity.

which gave me this: http://bigocheatsheet.com/ ever thing else was off topic (not helpful).  I would love to flame you all, but over time have realized that they take too much work.  And don't give me much satisfaction.

 
It is sorta covered in the JavaRanch Style Guide.
  • Post Reply Bookmark Topic Watch Topic
  • New Topic
Boost this thread!