我想制作简单的排序算法.
如果输入"abcde",我想要下面的输出.你能告诉我算法吗？
arr[0] = "a"
arr[1] = "ab"
arr[2] = "ac"
arr[3] = "ad"
arr[4] = "ae"
arr[5] = "abc"
arr[6] = "abd"
arr[7] = "abe"
...
arr[n] = "abcde"
arr[n+1] = "b"
arr[n+2] = "bc"
arr[n+3] = "bd"
arr[n+4] = "be"
arr[n+5] = "bcd"
arr[n+5] = "bce"
arr[n+5] = "bde"
...
arr[n+m] = "bcde"
...
...
可能重复:
如何在PHP中查找字符串的所有子字符串
查找列表的所有子集
如何计算字符串的所有可能子串？例如给出一个字符串ABCDE.所有可能的子串都将是
A,B,C,D,E,AB,BC,CD,DE,ABC,BCD,CDE,ABCD,BCDE,ABCDE
谢谢!伪代码将受到高度赞赏.:d