Python and Ruby, each with roots going back into the 1990s, are two of the most popular interpreted programming languages today. Ruby is most widely known as the language in which the ubiquitous Ruby on Rails web application framework is written, but it also has legions of fans that use it for things that have nothing to do with the web. Python is a big hit in the numerical and scientific computing communities at the present time, rapidly displacing such longtime stalwarts as R when it comes to these applications. It too, however, is also put to a myriad of other uses, and the two languages probably vie for the title when it comes to how flexible their users find them.

A Matter of Personality...

That isn't to say that there aren't some major, immediately noticeable, differences between the two programming tongues. Ruby is famous for its flexibility and eagerness to please; it is seen by many as a cleaned-up continuation of Perl's "Do What I Mean" philosophy, whereby the interpreter does its best to figure out the meaning of evening non-canonical syntactic constructs. In fact, the language's creator, Yukihiro Matsumoto, chose his brainchild's name in homage to that earlier language's gemstone-inspired moniker.

Python, on the other hand, takes a very different tact. In a famous Python Enhancement Proposal called "The Zen of Python," longtime Pythonista Tim Peters declared it to be preferable that there should only be a single obvious way to do anything. Python enthusiasts and programmers, then, generally prize unanimity of style over syntactic flexibility compared to those who choose Ruby, and this shows in the code they create. Even Python's whitespace-sensitive parsing has a feel of lending clarity through syntactical enforcement that is very much at odds with the much fuzzier style of typical Ruby code.

For example, Python's much-admired list comprehension feature serves as the most obvious way to build up certain kinds of lists according to initial conditions:

a = [x**3 for x in range(10,20)]
b = [y for y in a if y % 2 == 0]

first builds up a list of the cubes of all of the numbers between 10 and 19 (yes, 19), assigning the result to 'a'. A second list of those elements in 'a' which are even is then stored in 'b'. One natural way to do this in Ruby is probably:

a = (10..19).map {|x| x ** 3}
b = a.select {|y| y.even?}

but there are a number of obvious alternatives, such as:

a = (10..19).collect do |x|
x ** 3
end

b = a.find_all do |y|
y % 2 == 0
end

It tends to be a little easier to come up with equally viable, but syntactically distinct, solutions in Ruby compared to Python, even for relatively simple tasks like the above. That is not to say that Ruby is a messy language, either; it is merely that it is somewhat freer and more forgiving than Python is, and many consider Python's relative purity in this regard a real advantage when it comes to writing clear, easily understandable code.

And Somewhat One of Performance

Anonymous reprint from Quora (career advice)

Occasionally we come across a unique profound perspective that makes one stop and really listen. The following advice is one such as this.

1. Small actions compound: Reputation, career trajectory, and how others perceive you in the workplace can come down to a handful of things/moments that seem inconsequential/small at the time but compound. Random Thought: Redwood trees come from small seeds and time. With every action you're planting small seeds and these seeds can grow into something bigger (sometimes unimaginably bigger) over time. Don't let small basic mistakes sabotage your reputation because it only takes a few small snafus for people to lose confidence/trust in your ability to do more important tasks. Trust is a fragile thing and the sooner people can trust you the faster they'll give you more responsibility. Some Examples: Being on time (always) or early (better); spending an extra 10-15 minutes reviewing your work and catching basic mistakes before your boss does; structuring your work so it's easy for others to understand and leverage (good structure/footnotes/formatting); taking on unpleasant schleps/tasks (volunteer for them; don't complain; do it even when there's no apparent benefit to you)  


2. Rising tide lifts all boats: Fact: You don't become CEO of a multi-billion dollar public company in your 30s based purely on ability/talent. Your career is a boat and it is at the mercy of tides. No matter how talented you are it's a lot harder to break out in a sluggish situation/hierarchy/economy than a go-go environment. Even if you're a superstar at Sluggish Co., your upside trajectory (more often than not) is fractional to what an average/below average employee achieves at Rocket Ship Co. There's a reason Eric Schmidt told Sheryl Sandberg to "Get on a Rocket Ship". I had colleagues accelerate their careers/income/title/responsibility simply because business demand was nose bleed high (go go economy) and they were at the right place at the right time to ride the wave. Contrast that to the 2008 bust where earnings/promotions/careers have been clamped down and people are thankful for having jobs let alone moving up. Yes talent still matters but I think people generally overweight individual talent and underweight economics when evaluating/explaining their career successes. Sheryl Sandberg Quote: When companies are growing quickly and they are having a lot of impact, careers take care of themselves. And when companies aren’t growing quickly or their missions don’t matter as much, that’s when stagnation and politics come in. If you’re offered a seat on a rocket ship, don’t ask what seat. Just get on.


3. Seek opportunities where the outcome is success or failure. Nothing in between! You don't become a star doing your job. You become a star making things happen. I was once told early in my career that you learn the most in 1) rapidly growing organizations or 2) failing organizations.  I've been in both kinds of situations and wholeheartedly agree. Repeat. Get on a rocket ship. It'll either blow up or put you in orbit. Either way you'll learn a ton in a short amount of time. Put another way; seek jobs where you can get 5-10 years of work experience in 1-2 years.


4. Career Tracks & Meritocracies don't exist: Your career is not a linear, clearly defined trajectory.  It will be messy and will move more like a step function.


5. You will probably have champions and detractors on day 1: One interesting byproduct of the recruiting & hiring process of most organizations is it can create champions & detractors before you even start the job. Some folks might not like how you were brought into the organization (they might have even protested your hiring) and gun for you at every turn while others will give you the benefit of the doubt (even when you don't deserve one) because they stuck their neck out to hire you. We're all susceptible to these biases and few people truly evaluate/treat folks on a blank slate.


6. You'll only be known for a few things. Make those labels count: People rely on labels as quick filters. Keep this in mind when you pick an industry/company/job role/school because it can serve as an anchor or elevator in the future. It's unfortunate but that's the way it is. You should always be aware of what your "labels" are.


7. Nurture & protect your network and your network will nurture & protect you: Pay it forward and help people. Your network will be one of the biggest drivers of your success.

I will begin our blog on Java Tutorial with an incredibly important aspect of java development:  memory management.  The importance of this topic should not be minimized as an application's performance and footprint size are at stake.

From the outset, the Java Virtual Machine (JVM) manages memory via a mechanism known as Garbage Collection (GC).  The Garbage collector

• Manages the heap memory.   All obects are stored on the heap; therefore, all objects are managed.  The keyword, new, allocates the requisite memory to instantiate an object and places the newly allocated memory on the heap.  This object is marked as live until it is no longer being reference.
• Deallocates or reclaims those objects that are no longer being referened. 
• Traditionally, employs a Mark and Sweep algorithm.  In the mark phase, the collector identifies which objects are still alive.  The sweep phase identifies objects that are no longer alive.
• Deallocates the memory of objects that are not marked as live.
• Is automatically run by the JVM and not explicitely called by the Java developer.  Unlike languages such as C++, the Java developer has no explict control over memory management.
• Does not manage the stack.  Local primitive types and local object references are not managed by the GC.

So if the Java developer has no control over memory management, why even worry about the GC?  It turns out that memory management is an integral part of an application's performance, all things being equal.  The more memory that is required for the application to run, the greater the likelihood that computational efficiency suffers. To that end, the developer has to take into account the amount of memory being allocated when writing code.  This translates into the amount of heap memory being consumed.

Memory is split into two types:  stack and heap.  Stack memory is memory set aside for a thread of execution e.g. a function.  When a function is called, a block of memory is reserved for those variables local to the function, provided that they are either a type of Java primitive or an object reference.  Upon runtime completion of the function call, the reserved memory block is now available for the next thread of execution.  Heap memory, on the otherhand, is dynamically allocated.  That is, there is no set pattern for allocating or deallocating this memory.  Therefore, keeping track or managing this type of memory is a complicated process. In Java, such memory is allocated when instantiating an object:

String s = new String();  // new operator being employed
String m = "A String";    /* object instantiated by the JVM and then being set to a value.  The JVM
calls the new operator */

I suspect that many of you are familiar with the term "hard coding a value" whereby the age of an individual or their location is written into the condition (or action) of a business rule (in this case) as shown below:

if customer.age > 21 and customer.city == 'denver'

then ...

Such coding practices are perfectly expectable provided that the conditional values, age and city, never change. They become entirely unacceptable if a need for different values could be anticipated. A classic example of where this practice occurred that caused considerable heartache in the IT industry was the Y2K issue where dates were updated using only the last 2 digits of a four digit number because the first 2 digits were hard-coded to 19 i.e. 1998, 1999. All was well provided that the date did not advance to a time beyond the 1900’s since no one could be certain of what would happen when the millennia arrived (2000). A considerably amount of work (albeit boring) and money, approximately $200 billion, went into revising systems by way of software rewrites and computer chip replacements in order to thwart any detrimental outcomes. It is obvious how a simple change or an assumption can have sweeping consequences.

You may wonder what Y2K has to do with Business Rule Management Systems (BRMS). Well, what if we considered rules themselves to be hard-coded. If we were to write 100s of rules in Java, .NET or whatever language that only worked for a given scenario or assumption, would that not constitute hard-coded logic? By hard-coded, we obviously mean compiled. For example, if a credit card company has a variety of bonus campaigns, each with their own unique list of rules that may change within a week’s time, what would be the most effective way of writing software to deal with these responsibilities?