In applications that require only one solution, rather than all solutions, the expected running time of a brute force search will often depend on the order in which the candidates are tested.
在只需要一个解决方案而不是全部的应用程序中，暴力搜索的期望运行时间通常依赖于候选项测试的顺序。