C++计算器课程设计报告
C++计算器课程设计报告,含有部分代码,真实,调试成功的!
Welcome to the book list program for book names.What would you like to do ?1. add an element to end of lis t2. add an element at a location 3. find an element by book name (linear search) 4. find an element by book name (binary search) 5. delete an element at position 6. delete an element by book name 7. sort the list (using selection sort) 8. sort the list (using bubble sort) 9. print the list 0. exit1 以上功能绝对完全实现,物有所值!!
Please use recursion(递归)to get fibonacci numbers(一种整数数列). The user will specify(指定,详细说明) how many of the numbers he or she wants to print. You can use the main function to print the numbers, but make sure that the recursive function is being called recursively to get the numbers. Store the fibonacci numbers in an array(数组). Assume that the largest array size necessary will be 20.
void Binary_Search() while(1) { Welcome(); int n; cin >> n; switch(n) { case 1:Add_End();break; case 2:Add_Location();break; case 3:Linear_Search();break; case 4:Binary_Search();break; case 5:Delete_Position();break; case 6:Delete_Name();break; case 7:Selection_Sort();break; case 8:Bubble_Sort();break; case 9:Print_List();break; case 0:Exit();break; default: { cout << "Sorry,wrong number,please input again." <<endl; cout << "what do you want to do?"<< endl; cin>>n; } } 顺序查询,链式查询,添加,删除,功能齐全,代码完全可以直接使用。