Quicksort is a divide and conquer algorithm. Quicksort first divides a large list into two smaller sub-lists: the low elements and the high elements. Quicksort can then recursively sort the sub-lists. The steps are: Pick an element, called a pivo

一阶谓词逻辑实现经典的猴子摘香蕉问题，C++语言编写，(Realizing the first order logic monkey to pick the banana problem)