Do the following in the most efficient way possible in C Language: 1. Take an Array of 10 integer values (automatically should be converted to ascending order). 2. Insert Values - Value should be inserted automatically as per the ascending order. If array is {1,7,28,45,67,81} and the user inserts 31; the program should automatically insert at the 3rd index and array size should increase by 1. 3. Delete Values by Range - the user will be asked to two indexes (
Do the following in the most efficient way possible in C Language:
1. Take an Array of 10 integer values (automatically should be converted to ascending order).
2. Insert Values - Value should be inserted automatically as per the ascending order. If array is {1,7,28,45,67,81} and the user inserts 31; the program should automatically insert at the 3rd index and array size should increase by 1.
3. Delete Values by Range - the user will be asked to two indexes (<sizeofArray) and all values in between those indexed should be deleted. E.g. If array is {1, 7, 28, 45, 67,81} and user enters the indexes 2,4. Then the values 28, 45, 67 should be deleted.
Note: If at any time, the array becomes unsorted, then; some values need to be deleted at runtime to make the array sorted again. At any given time, the array shouldn't be unsorted.
Please do not use Pointers and only use Array as a Data Structure.
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 9 images
