Flashcards
Abstract Datatypes Arrays and linked Lists
Cards in this deck (4)
- 1Array insertion is:-Sometimes cheap at the end
-Always expensive in the middle - 2Insertion into linked lists if we have done the lookup is:-Cheap at the end
-Cheap in the middle - 3What datastructure you should choose if you have a varying number of homogenous elements?Depends on the access / processing patterns
- 4—
Information
- Description
- Exam Algorithms & Software Concepts (Exam Questions) Flashcards on Abstract Datatypes Arrays and linked Lists, created by Finnegan Fischer on 29/04/2021.
- Created by
- Finnegan Fischer
- Views
- 0
- Rating