Java an integer array of 20 elements, sorting the array from small to large, and then completing the following operations on the array: insert, find and delete.
This is not difficult. Let me tell you what I think. I'm a novice, too. Forget about sorting this out. Books often use it as an example. If you insert data, you can compare the methods one by one until you find a qualified one and get an array subscript. Can't you plug it in as required? Other ideas are similar. This is my train of thought. If it is wrong, please point it out and pay attention. . . .