diff options
| -rw-r--r-- | src/01/01b/README.md | 7 | ||||
| -rw-r--r-- | src/01/01b/stack_test.c (renamed from src/01/06/stack_test.c) | 0 | ||||
| -rw-r--r-- | src/01/06/Makefile (renamed from src/01/01b/Makefile) | 0 | ||||
| -rw-r--r-- | src/01/06/README.md | 7 | ||||
| -rw-r--r-- | src/01/06/main.c (renamed from src/01/01b/main.c) | 0 | ||||
| -rw-r--r-- | src/01/06/min_stack.c (renamed from src/01/01b/min_stack.c) | 0 | ||||
| -rw-r--r-- | src/01/06/min_stack.h (renamed from src/01/01b/min_stack.h) | 0 | ||||
| -rw-r--r-- | src/01/06/min_stack_test.c (renamed from src/01/01b/min_stack_test.c) | 0 |
8 files changed, 7 insertions, 7 deletions
diff --git a/src/01/01b/README.md b/src/01/01b/README.md index f288e0f..ceab17a 100644 --- a/src/01/01b/README.md +++ b/src/01/01b/README.md @@ -1,14 +1,13 @@ -# Learning Profile for Assignment #1 - Question #6 - Computer Science 272: Data Structures and Algorithms +# Learning Profile for Assignment #1 - Question #1b - Computer Science 272: Data Structures and Algorithms Name: Mo Khan Student ID: 3431709 1. Problem Statement: -Design and implement a MinStack data structure that can store comparable elements and supports the stack operations `push(x)`, `pop()`, and `size()`, -as well as the `min()` operation, which returns the minimum value currently stored in the data structure. +Implement the stack methods `push(x)` and `pop()` using two queues. -All operations should run in constant time. +Analyze the running time of the push(x) and pop() operations based on this implementation. 2. Description of the Code: 3. Errors and Warnings: diff --git a/src/01/06/stack_test.c b/src/01/01b/stack_test.c index b34c191..b34c191 100644 --- a/src/01/06/stack_test.c +++ b/src/01/01b/stack_test.c diff --git a/src/01/01b/Makefile b/src/01/06/Makefile index 8120d17..8120d17 100644 --- a/src/01/01b/Makefile +++ b/src/01/06/Makefile diff --git a/src/01/06/README.md b/src/01/06/README.md index ceab17a..f288e0f 100644 --- a/src/01/06/README.md +++ b/src/01/06/README.md @@ -1,13 +1,14 @@ -# Learning Profile for Assignment #1 - Question #1b - Computer Science 272: Data Structures and Algorithms +# Learning Profile for Assignment #1 - Question #6 - Computer Science 272: Data Structures and Algorithms Name: Mo Khan Student ID: 3431709 1. Problem Statement: -Implement the stack methods `push(x)` and `pop()` using two queues. +Design and implement a MinStack data structure that can store comparable elements and supports the stack operations `push(x)`, `pop()`, and `size()`, +as well as the `min()` operation, which returns the minimum value currently stored in the data structure. -Analyze the running time of the push(x) and pop() operations based on this implementation. +All operations should run in constant time. 2. Description of the Code: 3. Errors and Warnings: diff --git a/src/01/01b/main.c b/src/01/06/main.c index f90e37f..f90e37f 100644 --- a/src/01/01b/main.c +++ b/src/01/06/main.c diff --git a/src/01/01b/min_stack.c b/src/01/06/min_stack.c index adb96c8..adb96c8 100644 --- a/src/01/01b/min_stack.c +++ b/src/01/06/min_stack.c diff --git a/src/01/01b/min_stack.h b/src/01/06/min_stack.h index 567b0a4..567b0a4 100644 --- a/src/01/01b/min_stack.h +++ b/src/01/06/min_stack.h diff --git a/src/01/01b/min_stack_test.c b/src/01/06/min_stack_test.c index a02c163..a02c163 100644 --- a/src/01/01b/min_stack_test.c +++ b/src/01/06/min_stack_test.c |