algorithm

I want to begin by explaining what a matrix actually is: a rectangular array of numbers, symbols, or…

I use counting and probability whenever I need to reason about how many ways something can happen and…

I treat sets, relations, functions, graphs, and trees as the backbone vocabulary of discrete mathematics. I use sets…

I use summation notation whenever I need to express the addition of a sequence of terms compactly, especially…

I turn to approximation algorithms whenever I face a computational problem that is provably hard to solve exactly…

I use the theory of NP-completeness whenever I need to understand why certain computational problems seem fundamentally hard…

I use computational geometry whenever I need to design efficient algorithms for problems involving points, lines, polygons, and…

I use the Knuth-Morris-Pratt (KMP) algorithm whenever I need to search for occurrences of a pattern string within…

I use the finite automaton approach to string matching whenever I want to search for a pattern in…

I use the Rabin-Karp algorithm whenever I need to search for a pattern within a text using hashing…