Python programming language is general purpose open source programming language. One of its main features is flexibility and ease of use. Python has a variety of useful set of utilities and libraries for data processing and analytical tasks. Currently due to the rise in demand of big data processing python has grown in popularity because its features are easy to use which are core to the processing of huge chunks of information.

Guido Van Rossum, the pioneer of python, introduced python in the year 1980 and then implemented it in 1989. The intention behind the development of python was to make it open source language that can also be used for commercial projects. The fundamental principle of python is to write the code that is easy to use, highly readable and embrace writing fewer lines of code for achieving a particular task. One of the most popular standard libraries which have ready to use tools for performing a various work is Python Package Index. It was introduced in January 2016 and contains more than 72,000 packages for third-party software usage.

Python plays a critical role in linking data to customers. Recently python has found few entry barriers and many people have had access to have experienced the power of python in the past. So, what makes python the best language for big data analytics?

One of the reasons to choose python is that python ecosystem is very vibrant, the ratings at Redmonk are a proof of the strength python community. The Redmonk ranking is based on StackOverflow discussions and contribution made in Github to determine the popularity of programming language on the method used by users to ask questions about Python and the number of the open source projects contributions.

The original article was posted by Michael Veksler on Quora

A very well known fact is that code is written once, but it is read many times. This means that a good developer, in any language, writes understandable code. Writing understandable code is not always easy, and takes practice. The difficult part, is that you read what you have just written and it makes perfect sense to you, but a year later you curse the idiot who wrote that code, without realizing it was you.

The best way to learn how to write readable code, is to collaborate with others. Other people will spot badly written code, faster than the author. There are plenty of open source projects, which you can start working on and learn from more experienced programmers.

Readability is a tricky thing, and involves several aspects:

1. Never surprise the reader of your code, even if it will be you a year from now. For example, don’t call a function max() when sometimes it returns the minimum().
2. Be consistent, and use the same conventions throughout your code. Not only the same naming conventions, and the same indentation, but also the same semantics. If, for example, most of your functions return a negative value for failure and a positive for success, then avoid writing functions that return false on failure.
3. Write short functions, so that they fit your screen. I hate strict rules, since there are always exceptions, but from my experience you can almost always write functions short enough to fit your screen. Throughout my carrier I had only a few cases when writing short function was either impossible, or resulted in much worse code.
4. Use descriptive names, unless this is one of those standard names, such as i or it in a loop. Don’t make the name too long, on one hand, but don’t make it cryptic on the other.
5. Define function names by what they do, not by what they are used for or how they are implemented. If you name functions by what they do, then code will be much more readable, and much more reusable.
6. Avoid global state as much as you can. Global variables, and sometimes attributes in an object, are difficult to reason about. It is difficult to understand why such global state changes, when it does, and requires a lot of debugging.
7. As Donald Knuth wrote in one of his papers: “Early optimization is the root of all evil”. Meaning, write for readability first, optimize later.
8. The opposite of the previous rule: if you have an alternative which has similar readability, but lower complexity, use it. Also, if you have a polynomial alternative to your exponential algorithm (when N > 10), you should use that.

Use standard library whenever it makes your code shorter; don’t implement everything yourself. External libraries are more problematic, and are both good and bad. With external libraries, such as boost, you can save a lot of work. You should really learn boost, with the added benefit that the c++ standard gets more and more form boost. The negative with boost is that it changes over time, and code that works today may break tomorrow. Also, if you try to combine a third-party library, which uses a specific version of boost, it may break with your current version of boost. This does not happen often, but it may.

Don’t blindly use C++ standard library without understanding what it does - learn it. You look at std::vector::push_back() documentation at it tells you that its complexity is O(1), amortized. What does that mean? How does it work? What are benefits and what are the costs? Same with std::map, and with std::unordered_map. Knowing the difference between these two maps, you’d know when to use each one of them.

Never call new or delete directly, use std::make_unique and [cost c++]std::make_shared[/code] instead. Try to implement usique_ptr, shared_ptr, weak_ptr yourself, in order to understand what they actually do. People do dumb things with these types, since they don’t understand what these pointers are.

Every time you look at a new class or function, in boost or in std, ask yourself “why is it done this way and not another?”. It will help you understand trade-offs in software development, and will help you use the right tool for your job. Don’t be afraid to peek into the source of boost and the std, and try to understand how it works. It will not be easy, at first, but you will learn a lot.

Know what complexity is, and how to calculate it. Avoid exponential and cubic complexity, unless you know your N is very low, and will always stay low.

Learn data-structures and algorithms, and know them. Many people think that it is simply a wasted time, since all data-structures are implemented in standard libraries, but this is not as simple as that. By understanding data-structures, you’d find it easier to pick the right library. Also, believe it or now, after 25 years since I learned data-structures, I still use this knowledge. Half a year ago I had to implemented a hash table, since I needed fast serialization capability which the available libraries did not provide. Now I am writing some sort of interval-btree, since using std::map, for the same purpose, turned up to be very very slow, and the performance bottleneck of my code.

Notice that you can’t just find interval-btree on Wikipedia, or stack-overflow. The closest thing you can find is Interval tree, but it has some performance drawbacks. So how can you implement an interval-btree, unless you know what a btree is and what an interval-tree is? I strongly suggest, again, that you learn and remember data-structures.

These are the most important things, which will make you a better programmer. The other things will follow.

There has been and continues to be a plethora of observational studies by different researchers in the publishing industry focused on how e-books have affected hard-copy book sales. Evidence from these studies has indicated that there is a significant and monumental shift away from hard-copy books to e-books.[1]These findings precipitate fears that hard-copy books might become more expensive in the near future as they begin to be less available.  This scenario could escalate to the point where only collectors of hard-copy books are willing to pay the high price for ownership.

The founder of Amazon, Jeff Bezos, made a statement in July 2010 that sales of digital books had significantly outstripped U.S. sales of hard-copy. He claimed that Amazon had sold 143 digital books for its e-reader, the Kindle, for every 100 hard-back books over the past three months. The pace of this change was unprecedented;  Amazon said that in the four weeks of June 2010, the rate of sales had reached 180 e-books for every 100 hard-backs sold. Bezos said sales of the Kindle and e-books had reached a "tipping point", with five authors including Steig Larsson, the writer of Girl with a Dragon Tattoo, and Stephenie Meyer, who penned the Twilight series, each selling more than 500,000 digital books.[2] Earlier in July 2010, Hachette said that James Patterson had sold 1.1m e-books to date.

According to a report made by Publishers Weekly, for the first quarter of 2011, e-book sales were up 159.8%; netting sales of $233.1 million. Although adult hard-cover and mass market paperback hard-copies had continued to sell, posting gains in March, all the print segments had declined for the first quarter with the nine mass market houses that report sales. Their findings revealed a 23.4% sales decline, and that children’s paper-back publishers had also declined by 24.1%.[3] E-book sales easily out-distanced mass market paperback sales in the first quarter of 2011 with mass market sales of hard-copy books falling to $123.3 million compared to e-books’ $233.1 million in sales.

According to .net sales report by the March Association of American Publishers (AAP) which collected data and statistics from 1,189 publishers, the adult e-Book sales were $282.3 million in comparison to adult hard-cover book sales which counted $229.6 million during the first quarter of 2012. During the same period in 2011, eBooks revenues were $220.4 million.[4] These reports indicate a disconcerting diminishing demand for hard-copy books.

Studying a functional programming language is a good way to discover new approaches to problems and different ways of thinking. Although functional programming has much in common with logic and imperative programming, it uses unique abstractions and a different toolset for solving problems. Likewise, many current mainstream languages are beginning to pick up and integrate various techniques and features from functional programming.

Many authorities feel that Haskell is a great introductory language for learning functional programming. However, there are various other possibilities, including Scheme, F#, Scala, Clojure, Erlang and others.

Haskell is widely recognized as a beautiful, concise and high-performing programming language. It is statically typed and supports various cool features that augment language expressivity, including currying and pattern matching. In addition to monads, the language support a type-class system based on methods; this enables higher encapsulation and abstraction. Advanced Haskell will require learning about combinators, lambda calculus and category theory. Haskell allows programmers to create extremely elegant solutions.

Scheme is another good learning language -- it has an extensive history in academia and a vast body of instructional documents. Based on the oldest functional language -- Lisp -- Scheme is actually very small and elegant. Studying Scheme will allow the programmer to master iteration and recursion, lambda functions and first-class functions, closures, and bottom-up design.

Supported by Microsoft and growing in popularity, F# is a multi-paradigm, functional-first programming language that derives from ML and incorporates features from numerous languages, including OCaml, Scala, Haskell and Erlang. F# is described as a functional language that also supports object-oriented and imperative techniques. It is a .NET family member. F# allows the programmer to create succinct, type-safe, expressive and efficient solutions. It excels at parallel I/O and parallel CPU programming, data-oriented programming, and algorithmic development.

Scala is a general-purpose programming and scripting language that is both functional and object-oriented. It has strong static types and supports numerous functional language techniques such as pattern matching, lazy evaluation, currying, algebraic types, immutability and tail recursion. Scala -- from "scalable language" -- enables coders to write extremely concise source code. The code is compiled into Java bytecode and executes on the ubiquitous JVM (Java virtual machine).

Like Scala, Clojure also runs on the Java virtual machine. Because it is based on Lisp, it treats code like data and supports macros. Clojure's immutability features and time-progression constructs enable the creation of robust multithreaded programs.

Erlang is a highly concurrent language and runtime. Initially created by Ericsson to enable real-time, fault-tolerant, distributed applications, Erlang code can be altered without halting the system. The language has a functional subset with single assignment, dynamic typing, and eager evaluation. Erlang has powerful explicit support for concurrent processes.

Computer Programming as a Career?

What little habits make you a better software engineer?