Skip to content
  • Categories
  • Recent
  • Tags
  • Popular
  • World
  • Users
  • Groups
Skins
  • Light
  • Cerulean
  • Cosmo
  • Flatly
  • Journal
  • Litera
  • Lumen
  • Lux
  • Materia
  • Minty
  • Morph
  • Pulse
  • Sandstone
  • Simplex
  • Sketchy
  • Spacelab
  • United
  • Yeti
  • Zephyr
  • Dark
  • Cyborg
  • Darkly
  • Quartz
  • Slate
  • Solar
  • Superhero
  • Vapor

  • Default (No Skin)
  • No Skin
Collapse
Code Project
  1. Home
  2. The Lounge
  3. self-taught dev seeks computer science

self-taught dev seeks computer science

Scheduled Pinned Locked Moved The Lounge
learningasp-netcomalgorithmstutorial
22 Posts 14 Posters 0 Views 1 Watching
  • Oldest to Newest
  • Newest to Oldest
  • Most Votes
Reply
  • Reply as topic
Log in to reply
This topic has been deleted. Only users with topic management privileges can see it.
  • R raddevus

    Yesterday I got on the idea of learning basic Computer Science things (data structures, algorithms, etc) and I started looking for a book. I become afflicted with this idea every year or so. :rolleyes: I found all the normal ones like Introduction to Algorithms (The MIT Press) 3rd Edition, Kindle Edition by Thomas H. Cormen (Author), Charles E. Leiserson (Author), Ronald L. Rivest (Author), Clifford Stein [^] But that is way too mathy for me. I like math but I like it to be applied. Anyways, I wanted to really see Big O explained and tied to specific algorithms. I wanted to start out relative simply but not treat me like I'm totally ignorant. I stumbled upon this book from the Pragmatic Programmer publishers... A Common-Sense Guide to Data Structures and Algorithms: Level Up Your Core Programming Skills[^] I devoured the first 4 chapters and it is amazing. Definitely check this one out. I'm so excited about it. I feel like I'm really putting the concepts together. This one is going into the Top 5 All-time Best books on programming. Seriously up there with Petzold Windows programming. After reading those first 4 chapters I actually understand what O(1), O(N), O(log N) and O(N^2) mean. I even understand them in relation to algorithms. The author connects them to the algos and shows graphs of time / efficiency and it is absolutely clear and

    A Offline
    A Offline
    ajhampson
    wrote on last edited by
    #21

    I have read bits and pieces of Grokking Algorithms[^]. It seems like a very good intro for people who prefer a more visual approach.

    R 1 Reply Last reply
    0
    • A ajhampson

      I have read bits and pieces of Grokking Algorithms[^]. It seems like a very good intro for people who prefer a more visual approach.

      R Offline
      R Offline
      raddevus
      wrote on last edited by
      #22

      Thanks I will check that one out too. I'm finishing up this other one and I'll probably read Algorithms in a Nutshell: A Practical Guide George T. Heineman, Gary Pollice, Stanley Selkow[^] next.

      1 Reply Last reply
      0
      Reply
      • Reply as topic
      Log in to reply
      • Oldest to Newest
      • Newest to Oldest
      • Most Votes


      • Login

      • Don't have an account? Register

      • Login or register to search.
      • First post
        Last post
      0
      • Categories
      • Recent
      • Tags
      • Popular
      • World
      • Users
      • Groups