冒泡排序 首先确定要进行排序数组的大小，输入数字，进行排序

直接选择排序 在程序设置好直接要排序的链表，进行直接选择排序

基数排序 程序中预先设置了进行3次分配，用户可根据需要修改分配次数

顺序查找 对排完序的数据进行查找，如果成功则显示数字所在的数组位置

二叉排序树动态查找 -Bubble Sort to sort the first to identify the size of the array, enter the number of choices to sort of direct sequencing in the process set up to sort the list directly, direct selection procedures in order to sort the base set up in advance for 3 times the allocation, the user can be need to revise the allocation of the number of the order to find End of row sequence data to find, if successful figures showed an array of locations where the binary sort tree dynamic search