m

jooyelee · Apr 27, 2017 · 995105e · 995105e
1 parent 7e3257d
commit 995105e
Show file tree

Hide file tree

Showing 2 changed files with 11 additions and 0 deletions.
diff --git a/dev_notes/Algorithm_On_Strings.md b/dev_notes/Algorithm_On_Strings.md
@@ -1054,6 +1054,17 @@ This is all for the initialization phase of the suffix array construction. In ne
  - Cᵢ̍ == CᵢC<sub>i+L</sub> -- concatenation of strings
  - To compare Cᵢ̍ with Cⱼ̍ , it’s sufficient to compare Cᵢ with Cⱼ and C<sub>i+L</sub> with C<sub>j+L</sub>
 
+![](https://raw.githubusercontent.com/mebusy/notes/master/imgs/algorithm_on_string_doubledCyclicShift_example1.png)
+
+### Sorting pairs
+
+Now we have to think about the following problem.  We need to sort pairs of numbers basically. Because each cyclic shift of length L corresponds to its number of position in the order of all cyclic shifts of length L. 
+
+And we first need to sort by second element of pair, and then we stable sort by the first element of pair. 
+
+ - First sort by second element of pair
+ - Then stable sort by first element of pair
+
 
 
 

diff --git a/imgs/algorithm_on_string_doubledCyclicShift_example2.png b/imgs/algorithm_on_string_doubledCyclicShift_example2.png