Docsity
Docsity
Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity

Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan

Guidelines and tips
Guidelines and tips
Sell on Docsity
Sell on Docsity
Docsity AI
Docsity AI
Log inSign up

Prepare for your exams

Study with the several resources on Docsity

Find documents

Prepare for your exams with the study notes shared by other students like you on Docsity

Search for your university

Find the specific documents for your university's exams

Docsity AINEW

Summarize your documents, ask them questions, convert them into quizzes and concept maps

Explore questions

Clear up your doubts by reading the answers to questions asked by your fellow students

Earn points to download

Earn points by helping other students or get them with a premium plan

Share documents
download point icon20 Points

For each uploaded document

Answer questions
download point icon5 Points

For each given answer (max 1 per day)

All the ways to get free points
Get points immediately

Choose a premium plan with all the points you need

Study Opportunities

Choose your next study program

Get in touch with the best universities in the world. Search through thousands of universities and official partners

Community

Ask the community

Ask the community for help and clear up your study doubts

Free resources

Our save-the-student-ebooks!

Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors

Data Structure & Algorithms (Big-O Runtime & Memory Complexity, Pseudocode, Real-World Exa, Exams of Data Structures and Algorithms

Chamberlain College of NursingData Structures and Algorithms

Data Structure & Algorithms (Big-O Runtime & Memory Complexity, Pseudocode, Real-World Examples)

Typology: Exams

2024/2025

Available from 12/03/2024

Lectmark
Lectmark 🇺🇸

3.9

(7)

5.1K documents

1 / 13

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Data Structure & Algorithms (Big-O
Runtime & Memory Complexity,
Pseudocode, Real-World Examples)
O(1) - Time : Array : Access (Average)
O(1) - Time : Array : Access (Worst)
O(n) - Time : Array : Search (Average)
O(n) - Time : Array : Search (Worst)
O(n) - Time : Array : Insertion (Average)
O(n) - Time : Array : Insertion (Worst)
O(n) - Time : Array : Deletion (Average)
O(n) - Time : Array : Deletion (Worst)
O(n) - Space : Array : Space (Average)
O(1) - Time : Stack : Access (Average)
O(n) - Time : Stack : Search (Average)
pf3
pf4
pf5
pf8
pf9
pfa
pfd

Partial preview of the text

Download Data Structure & Algorithms (Big-O Runtime & Memory Complexity, Pseudocode, Real-World Exa and more Exams Data Structures and Algorithms in PDF only on Docsity!

Data Structure & Algorithms (Big-O

Runtime & Memory Complexity,

Pseudocode, Real-World Examples)

O(1) - Time : Array : Access (Average) O(1) - Time : Array : Access (Worst) O(n) - Time : Array : Search (Average) O(n) - Time : Array : Search (Worst) O(n) - Time : Array : Insertion (Average) O(n) - Time : Array : Insertion (Worst) O(n) - Time : Array : Deletion (Average) O(n) - Time : Array : Deletion (Worst) O(n) - Space : Array : Space (Average) O(1) - Time : Stack : Access (Average) O(n) - Time : Stack : Search (Average)

O(1) - Time : Stack : Insertion (Average) O(1) - Time : Stack : Deletion (Average) O(n) - Space : Stack : Space (Average) O(1) - Time : Queue : Access (Average) O(n) - Time : Queue : Search (Average) O(1) - Time : Queue : Insertion (Average) O(1) - Time : Queue : Deletion (Average) O(n) - Space : Queue : Space (Average) O(n) - Time : Singly-Linked List : Access (Average) O(n) - Time : Singly-Linked List : Search (Average) O(1) - Time : Singly-Linked List : Insertion (Average) O(1) - Time : Singly-Linked List : Deletion (Average) O(n) - Space : Singly-Linked List : Space (Average)

O(1) - Time : Hash Table : Access (Average) O(n) - Time : Hash Table : Access (Worst) O(1) - Time : Hash Table : Search (Average) O(n) - Time : Hash Table : Search (Worst) O(1) - Time : Hash Table : Insertion (Average) O(n) - Time : Hash Table : Insertion (Worst) O(1) - Time : Hash Table : Deletion (Average) O(n) - Time : Hash Table : Deletion (Worst) O(n) - Space : Hash Table : Space (Average) O(log n) - Time : Binary Search Tree : Access (Average) O(n) - Time : Binary Search Tree : Access (Worst) O(log n) - Time : Binary Search Tree : Search (Average) O(n) - Time : Binary Search Tree : Search (Worst)

O(log n) - Time : Binary Search Tree : Insertion (Average) O(n) - Time : Binary Search Tree : Insertion (Worst) O(log n) - Time : Binary Search Tree : Deletion (Average) O(n) - Time : Binary Search Tree : Deletion (Worst) O(n) - Space : Binary Search Tree : Space (Average) O(log n) - Time : Cartesian Tree : Access (Average) O(n) - Time : Cartesian Tree : Access (Worst) O(log n) - Time : Cartesian Tree : Search (Average) O(n) - Time : Cartesian Tree : Search (Worst) O(log n) - Time : Cartesian Tree : Insertion (Average) O(n) - Time : Cartesian Tree : Insertion (Worst) O(log n) - Time : Cartesian Tree : Deletion (Average)

O(log n) - Time : Red-Black Tree : Search (Average) O(log n) - Time : Red-Black Tree : Search (Worst) O(log n) - Time : Red-Black Tree : Insertion (Average) O(log n) - Time : Red-Black Tree : Insertion (Worst) O(log n) - Time : Red-Black Tree : Deletion (Average) O(log n) - Time : Red-Black Tree : Deletion (Worst) O(n) - Space : Red-Black Tree : Space (Average) O(log n) - Time : Splay Tree : Access (Average) O(n) - Time : Splay Tree : Access (Worst) O(log n) - Time : Splay Tree : Search (Average) O(n) - Time : Splay Tree : Search (Worst) O(log n) - Time : Splay Tree : Insertion (Average)

O(n) - Time : Splay Tree : Insertion (Worst) O(log n) - Time : Splay Tree : Deletion (Average) O(n) - Time : Splay Tree : Deletion (Worst) O(n) - Space : Splay Tree : Space (Average) O(log n) - Time : AVL Tree : Access (Average) O(log n) - Time : AVL Tree : Access (Worst) O(log n) - Time : AVL Tree : Search (Average) O(log n) - Time : AVL Tree : Search (Worst) O(log n) - Time : AVL Tree : Insertion (Average) O(log n) - Time : AVL Tree : Insertion (Worst) O(log n) - Time : AVL Tree : Deletion (Average) O(log n) - Time : AVL Tree : Deletion (Worst) O(n) - Space : AVL Tree : Space (Average)

O(log n) - Space : Quicksort : Worst O(n log n) - Time : Mergesort : Best O(n log n) - Time : Mergesort : Average O(n log n) - Time : Mergesort : Worst O(n) - Space : Mergesort : Worst O(n) - Time : Timsort : Best O(n log n) - Time : Timsort : Average O(n log n) - Time : Timsort : Worst O(n) - Space : Timsort : Worst O(n log n) - Time : Heapsort : Best O(n log n) - Time : Heapsort : Average O(n log n) - Time : Heapsort : Worst O(1) - Space : Heapsort : Worst

O(n) - Time : Bubble Sort : Best O(n²) - Time : Bubble Sort : Average O(n²) - Time : Bubble Sort : Worst O(1) - Space : Bubble Sort : Worst O(n) - Time : Insertion Sort : Best O(n²) - Time : Insertion Sort : Average O(n²) - Time : Insertion Sort : Worst O(1) - Space : Insertion Sort : Worst O(n²) - Time : Selection Sort : Best O(n²) - Time : Selection Sort : Average O(n²) - Time : Selection Sort : Worst O(1) - Space : Selection Sort : Worst

O(nk) - Time : Radix Sort : Average O(nk) - Time : Radix Sort : Worst O(n + k) - Space : Radix Sort : Worst O(n + k) - Time : Counting Sort : Best O(n + k) - Time : Counting Sort : Average O(n + k) - Time : Counting Sort : Worst O(k) - Space : Counting Sort : Worst O(n log n) - Time : Cubesort : Best O(n log n) - Time : Cubesort : Average O(n log n) - Time : Cubesort : Worst O(n) - Space : Cubesort : Worst