macosxnerd101's Profile User Rating: ****-

Reputation: 11075 Legendary
Active Posts:
46,022 (19.91 per day)
27-December 08
Profile Views:
Last Active:
User is online A minute ago
Viewing Board Index

Previous Fields

Who Cares
OS Preference:
Favorite Browser:
Favorite Processor:
Who Cares
Favorite Gaming Platform:
Who Cares
Your Car:
Dream Kudos:
Expert In:
Java, Graph Theory, Combinatorics, Data Structures, Economics

Latest Visitors

Icon   macosxnerd101 Please do not PM me with programming help requests.

Posts I've Made

  1. In Topic: codeacademy vs learn the hard way vs Online degree

    Posted 27 Apr 2015

    I'd personally avoid schools that offer online degree programs. I think you'll be wasting your money. Plus, you already have a Bachelor's degree plus an MBA. I'd take maybe a class on Intro to Programming followed by a Data Structures I class at community college. These courses will get you up to speed well enough that you can pick up what you need afterwards, provided you put in the effort with the coursework.

    Alternatively, find a MOOC or follow along with MIT's Open Course Ware. You'll get the same education from these as from an online school (arguably better), and you'll be getting them for free. Either way, to get anything out of an online program, you need to be disciplined to work through the material.
  2. In Topic: I've compiled a list of key CS theories explained in layman's

    Posted 27 Apr 2015


    Agree, most of the explanations are more geared towards junior computer science students who are confused with some of the theories.

    I remember falling into this category at one point. Big-O notation perplexed me, as I didn't know exactly what it meant. It was hard to find an approachable, concise, and accurate definition. I think furthermore, seeing it applied was tough as well. Most junior computer scientists will benefit the most from seeing things applied. I might suggest trying to cover three things in an explanation of a given topic: what the topic/term is precisely, how to apply it (ie., solve problems), and why anyone should care. I think that will resonate with many learners. :)

    Also, I was skimming through your link again and came across this:


    Note: Big O notation represents the worst-case scenario of an algorithm. Letís assume that O(1) and O(n) are the worst-case scenarios of the example above.

    It is something that tricks up a lot of people. Big-O denotes an asymptotic upper bound on a function. In the case of algorithms, we are interested in T(n), the runtime function of the algorithm where n is the size of the problem. Big-O does not represent the worst-case scenario of an algorithm. Consider Quicksort. Its average runtime complexity is O(n log n), while its worst case is O(n^2). It is also correct to say that Quicksort's time complexity is O(n!), as n^2 is dominated by n!. Saying Quicksort is O(n!) isn't the tightest upper bound though; hence, why it is a little misleading.
  3. In Topic: What is the difference between string and String?

    Posted 27 Apr 2015

    There is no type string in Java. That's a C++ type. There is a String class in Java.
  4. In Topic: codeacademy vs learn the hard way vs Online degree

    Posted 27 Apr 2015

    Code Academy is near-worthless, in my opinion. It's great for learning syntax, but it is very misleading for newbies. It makes them think that syntax == programming. This just isn't the case. Programming is much more about logic than syntax. Make sure you're implementing to solutions to problems, and that you're coming up with these solutions. This is how you learn, not by going through syntax exercises on Code Academy.

    My advice is to take a class or two in person so you can get the benefits cfoley explained. Then you should have enough experience to pick up a book and fill in wholes.
  5. In Topic: inheritance and Polymorphism

    Posted 27 Apr 2015

    Both accounts have been banned as duplicates. So I am merging the threads and re-opening so other folks who come across this thread may benefit.

    It is safe to assume that the OP does not need further help with this assignment though.

My Information

Member Title:
Games, Graphs, and Auctions
22 years old
January 5, 1993
Years Programming:
Programming Languages:
Expert: Java SE
Experienced: PHP, SQL, Android
Learning: Java ME, Erlang, C, Python

Contact Information

Website URL:
Website URL  http://


  • (21 Pages)
  • +
  • 1
  • 2
  • 3
  • Last »
  1. Photo

    depricated Icon

    03 Nov 2014 - 07:24
    I've had Summer Nights stuck in my head all morning and I blame you.
  2. Photo

    macosxnerd101 Icon

    09 Jul 2014 - 14:54
    The next time I'm in New York, I'm totally going!
  3. Photo

    modi123_1 Icon

    09 Jul 2014 - 11:58
    Make sure to plan a weekend trip:
  4. Photo

    da1 Icon

    17 Jun 2014 - 12:11
    Thanks for the help last night.
  5. Photo

    macosxnerd101 Icon

    02 Jun 2014 - 23:27
    That's a neat find! Definitely worth knowing about. Thanks for sharing!
  6. Photo

    jon.kiparsky Icon

    02 Jun 2014 - 23:24
    came across this title, thought you might find it worth knowing about:
  7. Photo

    pbl Icon

    22 May 2014 - 13:26
    Ya really busy making the books in
  8. Photo

    macosxnerd101 Icon

    14 May 2014 - 10:31
    We looked at polyhedra and vertex configurations in graph theory towards the end. Neat stuff! Thanks for sharing!
  9. Photo

    modi123_1 Icon

    14 May 2014 - 09:35
    Fun visualizations of hyperbolic shapes.
    "Hexagonal Hyperbolic Honeycombs"
  10. Photo

    modi123_1 Icon

    24 Mar 2014 - 13:20
    NP hard problem? Graph theory? Colored balls?! what's not to love?
  11. Photo

    macosxnerd101 Icon

    12 Feb 2014 - 12:21
    Thanks, everyone!
  12. Photo

    Martyr2 Icon

    11 Feb 2014 - 11:53
    Congrats on the legendary status. Well deserved.
  13. Photo

    Dogstopper Icon

    10 Feb 2014 - 11:21
    Wow. 10k reputation! That's pretty amazing
  14. Photo

    belgarion262 Icon

    10 Feb 2014 - 09:49
    10,000 Rep, congrats :p
  15. Photo

    andrewsw Icon

    10 Feb 2014 - 02:48
    Wow, 10k?! Legend, wait for it, -ary!
  • (21 Pages)
  • +
  • 1
  • 2
  • 3
  • Last »