String Algorithms
String Algorithms. David Kauchak cs302 Spring 2012. Strings. Let Σ be an alphabet, e.g. Σ = ( , a, b, c, …, z) A string is any member of Σ *, i.e. any sequence of 0 or more members of Σ ‘ this is a string ’ Σ * ‘ this is also a string ’ Σ * ‘ 1234 ’ Σ *. String operations.
1.47k views • 110 slides