孙佰贵的专栏

Problem Definition: Given a text txt[0..n-1] and a pattern pat[0..m-1], write a function search(char pat[], char txt[]) that prints all occurrences of pat[] in txt[]. You may assume that n >

Divide and Conquer is an algorithmic paradigm based on multi-branched recursion. A typical Divide and Conquer algorithm solves a problem using following three steps: 1. Divide: Break the giv

Greedy is an algorithmic paradigm that builds up a solution piece by piece, always choosing the next piece that offers the most obvious and immediate benefit. Greedy algorithms are used for optimiza

Dynamic Programming is an algorithmic paradigm that solves a given complex problem by breaking it into subproblems andstores the results of subproblems to avoid computing the same results again. Follo

A sorting algorithm is an algorithm that puts elements of a list in a certain order. The most-used orders are numerical order and lexicographical order. There are two mainly kind of sorting algori

When should you use bitwise operators? Bitwise operators are used forsaving more space orsaving some time. There are also times when you need to use bitwise operators: if you're working with co

There are there main methods to solve this problem. 1. sunstitution method     1.1 guess the form of solution, the recursion-tree method can help to get a good guess     1.2 use mathematical in