Notice
Recent Posts
Recent Comments
Link
일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | |||
5 | 6 | 7 | 8 | 9 | 10 | 11 |
12 | 13 | 14 | 15 | 16 | 17 | 18 |
19 | 20 | 21 | 22 | 23 | 24 | 25 |
26 | 27 | 28 | 29 | 30 | 31 |
Tags
- Hash Table
- project euler
- Hash function
- Ipython
- django framework
- Python3
- linked list
- virtualenv
- ubuntu
- 주피터
- 아나콘다
- 국산 네트워크
- virtualenvwrapper
- 파이썬
- 우분투
- 백준 알고리즘
- jupyter
- 프로젝트 오일러
- KTNF
- Django
- data structure
- Python
- 파이썬3
- Euler
- Anaconda
- IO Visor
- 다이나믹 프로그래밍
- 문자열
- FNCP
- 피보나치 수
Archives
- Today
- Total
태코놀로지
Linked List - advantages & disadvantages 본문
Advantages
1. Size varies dynamically (dynamic set)
- Unlike the static array (static set) you don't need to reserve a large memory in advance
2. Insertion, deletion, merging, splitting take only constant time (cf. takes linear time for search operation)
- In contrast, array takes linear time (i.e., proportional to the size) for these operations
Disadvantages
1. You cannot access an element using an index
2. Need memories for storing pointers("perv" and "next")
3. Running time for "finding" is proportional to the size of the list (even when a list is sorted!)
Comments