On baier's sort of maximal lyndon substrings

We describe and analyze in terms of Lyndon words an elementary sort of maximal Lyndon factors of a string and prove formally its correctness. Since the sort is based on the first phase of Baier's algorithm for sorting of the suffixes of a string, we refer to it as Baier's sort.