Waste less time on Facebook — follow Brilliant.

Shuffle~ shuffle~

Consider a string of length \(n\) where \(n\) is an positive integer. Also consider some functions or programs that will rearrange the orders of characters of the string given in a certain way according to the program. Note that no function/program can modify the length of the string given (adding or deleting characters) or change its behavior/method of rearranging. Prove or disprove that if a string \(S\) is being fed into a series of function/program, the result will always be the same regardless of the order of the programs.

Note by Tan Wei Xin
1 year, 3 months ago

No vote yet
1 vote


There are no comments in this discussion.


Problem Loading...

Note Loading...

Set Loading...