ON A NEW SORTING ALGORITHM WHICHLOOKS LIKE CHAINS AND FORKS(CONTINUE)

3 Brief explanation of the programs The No.3 program demostrates a sorting process, its sorting key word is character string. It needs to create a string file before it runs. The length of each string is ramdom, length maximum is 20, a string consists of 26 lower letters a..z. The No.2 program and No.1 program demostrate repectively a sorting process too, their sorting key words are integer