Void of Void

Cover a checkerboard that has one corner square missing. The size of the board is usuall 2**k, use recursive way the board will bedivided into four 2**(k-1) size small board. Cover the center board

1D Peak FindingObjectiveGiven an array A with n elements, find the index i of the peak element A[i] where A[i] >= A[i - 1]and A[i] >= A[i + 1]. For elements on the boundaries of the array, the

As you know, PageRank is very famous algorithm. For the detail of pagerank defination and implemenation, you can refer tohttps://en.wikipedia.org/wiki/PageRank    There are many implementa

Note: in order to use "numpy" as "np" as shown in the table, you need to import NumPy like this:import numpy as np  MATLAB/OctaveNumPyCreating Matrices (here: 3x3 mat

Sometimes there will

Higher order function is great concept in

Merge Sort is very efficient in sorting a list of elements with O(nlgn) complexity. It is used with divide and conquer strategy.A few days ago, I came to an interview question, the description o

The longest common subsequence problem is a very basic problem in dynamic programming. If you dive in,there is manyothermethods to compute thelongest common subsequence. Hereis just the very basic

import random# partition list L use the rightest element as pivot def partition(L, left, right): x = L[right] i = left - 1 for j in range(left, right): if L[j] < x:

from graphics import *class BouncingBall(): def __init__(self, win,center, ball_radius, x, y): self.ball_circle = Circle(center, ball_radius) self.win = win self.

class ListStack: # create an empty stack def __init__(self): self.elems = list() def isEmpty(self): return len(self) == 0 # return the number in the stack

import mathimport randomclass Point(): def __init__(self, x = 0, y = 0): self.x = x self.y = y def set_rand_range(self, rand_start, rand_end): self.rand_st

class NQueen: def __init__(self, n): self.n = n self.board = self.create_borad(self.n) self.queens = 0 self.row_exist = [0 for i in range(n)] # row check queen exis

class ListNode: def __init__(self, data): self.data = data self.next = None class CircleList: def __init__(self): self.head = None # add a no

Python3 must be installed before the complete instillation can be completed. If you don't have Python installed you can install it usingthese directionsInstall the PyDev plug-in for Eclipse

Document DistanceDocument = sequence of words-Ignore punctuation & formattingWord = sequence of alphanumeric charactersHow to define "distance"?Idea: focus on shared wordsWord