Welcome to the Treehouse Community

Want to collaborate on code errors? Have bugs you need feedback on? Looking for an extra set of eyes on your latest project? Get support with fellow developers, designers, and programmers of all backgrounds and skill levels here with the Treehouse Community! While you're at it, check out some resources Treehouse students have shared here.

Looking to learn something new?

Treehouse offers a seven day free trial for new students. Get access to thousands of hours of content and join thousands of Treehouse students and alumni in the community today.

Start your free trial

General Discussion

Ben B
Ben B
994 Points

Anyone else want to see content on search algorithms (BFS, Dijkstra, A*, etc) and AI, etc

I think it would be cool to see some content on general programming algorithms and concepts. Like search algorithms (BFS, A*, etc) and how to apply them to real problems like AI, etc.

So far Treehouse is very focused on teaching specific languages from the ground up even for people with zero programming knowledge. This is really great but I think it would be well complimented if there was content teaching algorithms and programming concepts. Being a mostly self taught programmer this is the sort of thing I lack that someone with formal education would know. I assume many tree house students are in the same boat.

Is there anyone else who would like to see content like this?

1 Answer

I would love to see this kind of content. Not having a formal computer science background, I feel like I have quite a few holes in my knowledge, rather large ones, no doubt. The more I learn about CS and programming, the more I realize how much there is to learn. It feels like drinking from a firehose at times. I'm trying to shore up my deficits by reading as much as I can from as many reliable sources as I can find, but it would be nice to have some videos and tutorials on Treehouse to supplement my studies.

I'm confident this content would be quite useful and appreciated by many Treehouse students.