Design and Analysis of

Algorithm
String Searching and Sorting

Sohail Ahmad
Barani Institute of Management Science
String Matching Algorithm
1. Exact String Matching
2. Approximate String Matching
Exact String Matching Algorithm:
Brute Force Algorithm
Boyer Morre Algorithm (Boyer Morre)
KMP Algorithm (Knuth – Morries – Pratt)
Robin Karp Algorithm (Robin Karp)
String matching
 pattern: a string of m characters to search for
 text: a (long) string of n characters to search in
 Brute force algorithm:
1. Align pattern at beginning of text
2. moving from left to right, compare each character of
pattern to the corresponding character in text until
 all characters are found to match (successful search); or
 a mismatch is detected
3. while pattern is not found and the text is not yet exhausted,
realign pattern one position to the right and repeat step 2.
 String Matching
Pattern: GATTTCG (length = m = 7)
Text: GATTTCATCAGATTTCGATACAGAT
GATTTCG
GATTTCG
GATTTCG
GATTTCG
GATTTCG
GATTTCG
GATTTCG
GATTTCG
GATTTCG
GATTTCG
GATTTCG

Text length = n = 25
Best Case: ?
Worst Case: ?
Brute Force String Matching
Pattern length = m;
Text length = n;
Best Case:
GATTTCATCAGATTTCGATACAGAT
GATTTCA
O(m) The pattern is found right away, but
you still have to do m comparison to verify
that is was found.
Brute Force String Matching
Pattern length = m;
Text length = n;
Worst Case:
O(mn)
How is this possible?

AAAAAAB
AAB
The running time indeed belongs to O(m(n-m+1)).
But as the Big-O notation is an upper bound,
this is also O(mn), as mn ≥ m(n-m).
Brute Force Algorithm:
Brute Force Algorithm Analysis
Time Complexities:
Best Case: O(n-m) if n>m
or O(m)
Worst Case: O(m(n-m+1)) or O(nm)
Space Complexity:
S(n) = O(1) or Constant.
Boyer Moore Algorithm:
Example:
Text: “Welcome to Advance Algorithm Class”
Pattern: ‘Advance’

 A D V A N C E Length=7
Index: 0 1 2 3 4 5 6
 A D V A N C E Length=7
Index: 0 1 2 3 4 5 6
Value= (length-index-1) D=7-1-1=5
Letter A D V N C E *
Value 3 5 4 2 1 7 7

Last Letter= Length, if not already defined

 Letter A D V N C E *
Value 3 5 4 2 1 7 7

W e l c o m e t o A d v a n c e A l g o r i t h m C l a s s
Advanc e
 Letter A D V N C E *
Value 3 5 4 2 1 7 7

W e l c o m e t o A d v a n c e A l g o r i t h m C l a s s
Advanc e
 Letter A D V N C E *
Value 3 5 4 2 1 7 7

W e l c o m e t o A d v a n c e A l g o r i t h m C l a s s
Advanc e
 Letter A D V N C E *
Value 3 5 4 2 1 7 7

W e l c o m e t o A d v a n c e A l g o r i t h m C l a s s
 Advance
 Letter A D V N C E *
Value 3 5 4 2 1 7 7

W e l c o m e t o A d v a n c e A l g o r i t h m C l a s s
 Advance
 Letter A D V N C E *
Value 3 5 4 2 1 7 7

W e l c o m e t o A d v a n c e A l g o r i t h m C l a s s
 Advance
 Letter A D V N C E *
Value 3 5 4 2 1 7 7

W e l c o m e t o A d v a n c e A l g o r i t h m C l a s s
 Advance
 Letter A D V N C E *
Value 3 5 4 2 1 7 7

W e l c o m e t o A d v a n c e A l g o r i t h m C l a s s
 Advance
 Letter A D V N C E *
Value 3 5 4 2 1 7 7

W e l c o m e t o A d v a n c e A l g o r i t h m C l a s s
 Advance
 Letter A D V N C E *
Value 3 5 4 2 1 7 7

W e l c o m e t o A d v a n c e A l g o r i t h m C l a s s
 Advance
 Letter A D V N C E *
Value 3 5 4 2 1 7 7

W e l c o m e t o A d v a n c e A l g o r i t h m C l a s s
 Advance
 Letter A D V N C E *
Value 3 5 4 2 1 7 7

W e l c o m e t o A d v a n c e A l g o r i t h m C l a s s
 Advance
Best Case : BM Algorithm
Text: A B C D A A A A B C D A
Pattern: X Y Z

Text Length = 12
Pattern Length = 3 Letter X Y Z *
Index 0 1 2
Value 2 1 3 3

Last Letter= Length, if not already defined

Best Case : BM Algorithm
Text: A B C D A A A A B C D A
Pattern: X Y Z

Text Length = 12
Pattern Length = 3 Letter X Y Z *
Index 0 1 2
Value 2 1 3 3

Last Letter= Length, if not already defined

Best Case : BM Algorithm
Text: A B C D A A A A B C D A
Pattern: X Y Z

Text Length = 12
Pattern Length = 3 Letter X Y Z *
Index 0 1 2
Value 2 1 3 3

Last Letter= Length, if not already defined

Best Case : BM Algorithm
Text: A B C D A A A A B C D A
Pattern: X Y Z

Text Length = 12
Pattern Length = 3 Letter X Y Z *
Index 0 1 2
Value 2 1 3 3

Last Letter= Length, if not already defined

Best Case : BM Algorithm
Text: A B C D A A A A B C D A
Pattern: X Y Z

Text Length = n= 12
Pattern Length = m = 3

Best Case Time Complexity: T(n) = 12/3 = n/m

Worst Case : BM Algorithm
Text: A A A A A A A A A
Pattern: AAA

Text Length = 9
Pattern Length = 3

Worst Case Time Complexity: O(m(n-m+1) = O(nm)

BM Algorithm Analysis
Time Complexity:
Best Case : O(n/m)
Worst Case: O(n*m)
Space Complexity:
S(n): O(m+ ω)
 ω is the unique Number of alphabets
Knuth–Morris–Pratt(KMP)
Algorithm
Text: a b c x a b c d a b c d a b c y
Pattern: a b c d a b c y

 j i
Pattern a b c d a b c y
Index 0 1 2 3 4 5 6 7
Value 0
Text: a b c x a b c d a b c d a b c y
Pattern: a b c d a b c y

 j i
Pattern a b c d a b c y
Index 0 1 2 3 4 5 6 7
Value 0 0
Text: a b c x a b c d a b c d a b c y
Pattern: a b c d a b c y

 j i
Pattern a b c d a b c y
Index 0 1 2 3 4 5 6 7
Value 0 0 0
Text: a b c x a b c d a b c d a b c y
Pattern: a b c d a b c y

 j i
Pattern a b c d a b c y
Index 0 1 2 3 4 5 6 7
Value 0 0 0 0
Text: a b c x a b c d a b c d a b c y
Pattern: a b c d a b c y
 j+1
 j i
Pattern a b c d a b c y
Index 0 1 2 3 4 5 6 7
Value 0 0 0 0 1
Text: a b c x a b c d a b c d a b c y
Pattern: a b c d a b c y
 j+1
 j i
Pattern a b c d a b c y
Index 0 1 2 3 4 5 6 7
Value 0 0 0 0 1 2
Text: a b c x a b c d a b c d a b c y
Pattern: a b c d a b c y
 j+1
 j i
Pattern a b c d a b c y
Index 0 1 2 3 4 5 6 7
Value 0 0 0 0 1 2 3
Text: a b c x a b c d a b c d a b c y
Pattern: a b c d a b c y

 j i
Pattern a b c d a b c y
Index 0 1 2 3 4 5 6 7
Value 0 0 0 0 1 2 3
Text: a b c x a b c d a b c d a b c y
Pattern: a b c d a b c y

 j i
Pattern a b c d a b c y
Index 0 1 2 3 4 5 6 7
Value 0 0 0 0 1 2 3
Text: a b c x a b c d a b c d a b c y
Pattern: a b c d a b c y

 j i
Pattern a b c d a b c y
Index 0 1 2 3 4 5 6 7
Value 0 0 0 0 1 2 3 0
a b c x a b c d a b c d a b c y
a b c d a b c y

Pattern a b c d a b c y
Index 0 1 2 3 4 5 6 7
Value 0 0 0 0 1 2 3 0
a b c x a b c d a b c d a b c y
a b c d a b c y

Pattern a b c d a b c y
Index 0 1 2 3 4 5 6 7
Value 0 0 0 0 1 2 3 0
a b c x a b c d a b c d a b c y
a b c d a b c y

Pattern a b c d a b c y
Index 0 1 2 3 4 5 6 7
Value 0 0 0 0 1 2 3 0
a b c x a b c d a b c d a b c y
a b c d a b c y

Pattern a b c d a b c y
Index 0 1 2 3 4 5 6 7
Value 0 0 0 0 1 2 3 0
a b c x a b c d a b c d a b c y
a b c d a b c y

Pattern a b c d a b c y
Index 0 1 2 3 4 5 6 7
Value 0 0 0 0 1 2 3 0
a b c x a b c d a b c d a b c y
 a b c d a b c y

Pattern a b c d a b c y
Index 0 1 2 3 4 5 6 7
Value 0 0 0 0 1 2 3 0
a b c x a b c d a b c d a b c y
 a b c d a b c y

Pattern a b c d a b c y
Index 0 1 2 3 4 5 6 7
Value 0 0 0 0 1 2 3 0
a b c x a b c d a b c d a b c y
 a b c d a b c y

Pattern a b c d a b c y
Index 0 1 2 3 4 5 6 7
Value 0 0 0 0 1 2 3 0
a b c x a b c d a b c d a b c y
 a b c d a b c y

Pattern a b c d a b c y
Index 0 1 2 3 4 5 6 7
Value 0 0 0 0 1 2 3 0
a b c x a b c d a b c d a b c y
 a b c d a b c y

Pattern a b c d a b c y
Index 0 1 2 3 4 5 6 7
Value 0 0 0 0 1 2 3 0
a b c x a b c d a b c d a b c y
 a b c d a b c y

Pattern a b c d a b c y
Index 0 1 2 3 4 5 6 7
Value 0 0 0 0 1 2 3 0
a b c x a b c d a b c d a b c y
 a b c d a b c y

Pattern a b c d a b c y
Index 0 1 2 3 4 5 6 7
Value 0 0 0 0 1 2 3 0
a b c x a b c d a b c d a b c y
 a b c d a b c y

Pattern a b c d a b c y
Index 0 1 2 3 4 5 6 7
Value 0 0 0 0 1 2 3 0
a b c x a b c d a b c d a b c y
 a b c d a b c y

Pattern a b c d a b c y
Index 0 1 2 3 4 5 6 7
Value 0 0 0 0 1 2 3 0
a b c x a b c d a b c d a b c y
 a b c d a b c y

Pattern a b c d a b c y
Index 0 1 2 3 4 5 6 7
Value 0 0 0 0 1 2 3 0
a b c x a b c d a b c d a b c y
 a b c d a b c y

Pattern a b c d a b c y
Index 0 1 2 3 4 5 6 7
Value 0 0 0 0 1 2 3 0
a b c x a b c d a b c d a b c y
 a b c d a b c y

Pattern a b c d a b c y
Index 0 1 2 3 4 5 6 7
Value 0 0 0 0 1 2 3 0
a b c x a b c d a b c d a b c y
 a b c d a b c y

Pattern a b c d a b c y
Index 0 1 2 3 4 5 6 7
Value 0 0 0 0 1 2 3 0
a b c x a b c d a b c d a b c y
 a b c d a b c y

Pattern a b c d a b c y
Index 0 1 2 3 4 5 6 7
Value 0 0 0 0 1 2 3 0
a b c x a b c d a b c d a b c y
 a b c d a b c y

Pattern a b c d a b c y
Index 0 1 2 3 4 5 6 7
Value 0 0 0 0 1 2 3 0
a b c x a b c d a b c d a b c y
 a b c d a b c y

Pattern a b c d a b c y
Index 0 1 2 3 4 5 6 7
Value 0 0 0 0 1 2 3 0
Best Case : KMP Algorithm
Text: A B C D A A A A B C D A
Pattern: X Y Z
Letter X Y Z
Text Length = 12
Index 0 1 2
Pattern Length = 3
Value 0 0 0

Best Case Time Complexity: T(n) = O(n-m) = O(n)

Worst Case : BM Algorithm
Text: A B A B A B A B A B
Pattern: ABAB
Letter A B A B

Text Length = 9 Index 0 1 2 3

Pattern Length = 3 Value 0 0 1 2

After matched, jump equal to value of jth index.

Worst Case : BM Algorithm
Text: A B A B A B A B A B
Pattern: ABAB
Letter A B A B

Text Length = 9 Index 0 1 2 3

Pattern Length = 3 Value 0 0 1 2

After matched, jump equal to value of jth index.

Worst Case : BM Algorithm
Text: A B A B A B A B A B
Pattern: ABAB
Letter A B A B

Text Length = 9 Index 0 1 2 3

Pattern Length = 3 Value 0 0 1 2

After matched, jump equal to value of jth index.

Worst Case : BM Algorithm
Text: A B A B A B A B A B
Pattern: ABAB

Letter A B A B
Text Length = 9
Pattern Length = 3 Index 0 1 2 3
Value 0 0 1 2

After matched, jump equal to value of jth index.

Worst Case : BM Algorithm
Text: A B A B A B A B A B
Pattern: ABAB

Letter A B A B
Text Length = 9
Pattern Length = 3 Index 0 1 2 3
Value 0 0 1 2

Worst Case Time Complexity: T(n) = O(n).

KMP Algorithm Analysis
Time Complexity:
Best Case : O(n)
Worst Case: O(n)
Space Complexity:
S(n): O(m)
Comparisons of different algorithms
Time complexity Space complexity

Brute Force Best case: O(n) or O(1)

O(m)
Worst Case: O(mn)
Rabin–Karp string search Best case: O(n) O(m)
algorithm Worst Case: O(mn)

Knuth–Morris–Pratt algorithm O(m+n) O(m)

Boyer–Moore string search Best case: O(n/m) O(m + |Σ|)

algorithm Worst Case: O(mn)