# Month: September 2018

## The one surprising thing that cripples your coding productivity most

Dear Friend, You are doing great. By joining this interactive Python email course, you have proven that you are ambitious to learn. Well done! I offer this course for free because I believe that you and I can work together, via email, to create a new form of swarm intelligence. It’s likely that you are … ## NumPy arange(): A Simple Illustrated Guide

The np.arange() function appears in 21% of the 35 million Github repositories that use the NumPy library! This illustrated tutorial shows you the ins and outs of the NumPy arange function. So let’s get started! What’s the NumPy Arange Function? The np.arange([start,] stop[, step]) function creates a new NumPy array with evenly-spaced integers between start … ## 10 Reasons Why Solving Code Puzzles Makes You Smarter

A code puzzle is an educative snippet of source code that teaches a single computer science concept by activating the learner’s curiosity and involving them in the learning process.

## [Basics Computer Science] A Recursive Pathfinder Algorithm in Python

[python] def find_path(graph, v_start, v_end, path_len=0): ”’Is there a path between vertex v_start and vertex v_end?”’ # Traverse each vertex only once if path_len >= len(graph): return False # Direct path from v_start to v_end? if graph[v_start][v_end]: return True # Indirect path via neighbor v_nbor? for v_nbor, edge in enumerate(graph[v_start]): if edge: # between v_start …