Which data structures would result in the data being sorted soon after being inserted
Answers
Answered by
3
If you go for the Insertion sort algorithm, then in this data structure, the data that you enter will be sorted soon after getting inserted.
For example- If you have got ten cards to enter. So when you enter the card, then it will compare the card with other. After comparison, the new card will be placed at its position.
Similar questions