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 |
Tags
- binary search tree
- 화장실 지도
- 데이터 분석가
- Linked List
- priority queue
- Data Engineer
- hash
- exam
- Study
- Newyork
- Preparing for the Google Cloud Professional Data Engineer Exam
- 빅데이터
- Algorithms
- Binary Tree
- algorithm
- 빅데이터 커리어 가이드북
- Data Analyst
- BST
- 데이터 엔지니어
- Heap
- data scientist
- 빅데이터 지식
- 뉴욕 화장실
- Restroom
- data
- Computer Science
- dataStructure
- HEAPS
- Data Structure
- Computer Organization
Archives
- Today
- Total
목록Stack (1)
Jaegool_'s log
IT 279: Algorithms and Data Structures, Week 2 recap
Progress Check on Algorithm Analysis 1. Put these in order from lowest to highest. Lowest O(1) O(log n) O(n) O(n log n) O(n2) O(n3) Highest 2. The actual running time of a given function is determined by the expression 3n + 4 + 5n2. What is the Big-Oh notation that accurately describes the function? c. O(n^2) a. O(n) b. O(3n) c. O(n^2) d. O(5n^2) 3. You have analyzed a particular program to be O..
Courses
2023. 10. 3. 05:22