Skip to content

Commit a9bbbaf

Browse files
committed
Create prob14
1 parent c2876ec commit a9bbbaf

File tree

1 file changed

+29
-0
lines changed

1 file changed

+29
-0
lines changed

prob14

Lines changed: 29 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,29 @@
1+
//Solved by Sai Shree, Dept of CSE
2+
3+
Array
4+
5+
An array will eventually either fill up or need to be
6+
resized, an expensive operation that may not even
7+
be possible if memory is fragmented.
8+
9+
If many elements are removed memory may
10+
become wastefully empty or need to be made
11+
smaller.
12+
13+
Arrays allow random access to elements.
14+
15+
Searching becomes bit easier
16+
17+
Linked list
18+
19+
Elements can be inserted into linked lists
20+
indefinitely.
21+
22+
This is not a big issue in Linked list.
23+
24+
Linked lists allow only sequential access to
25+
elements.
26+
27+
Searching consumes time when compared to Array
28+
because it has to access sequentially
29+

0 commit comments

Comments
 (0)