* This program realizes the simple operation of linked list, such as create, sort, display, merge linked list, search (by address and by value), delete (by value and address) and insert operation.
* In my test plan, I used two arrays to create linked lists LA and LB, using different linked list creation functions (CreateLA and CreateLB), and then used MergeLists to merge the two linked lists into LC.
* Then do the following:
1) find the location of the given element in the LC (such as 65) and display it on the screen
2) find the value of the location given in the LC (such as the fifth element) and display it on the screen
3) delete the given in the LC A value (such as 82)
4) removes the value of the given position (that is, the number of elements) in the LC.
5) display the data of LC after the previous operation is completed.
6) insert the number 55, 43 into the LC, while keeping the data in descending order in the LC, and then display all the data in the LC on the screen.
7) insert any number of integers into the LA,LB table, and note that the data in LA and LB is still in descending order. Then update the LC and display the contents of the updated table LC.
