Fix question #

3 files changed, 3 insertions, 14 deletions

diff --git a/src/01/01b/README.md b/src/01/01b/README.md
index e1d3b90..f288e0f 100644
--- a/src/01/01b/README.md
+++ b/src/01/01b/README.md
@@ -1,4 +1,4 @@
-# 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
diff --git a/src/01/01b/min_stack.h b/src/01/01b/min_stack.h
index e75c2d7..567b0a4 100644
--- a/src/01/01b/min_stack.h
+++ b/src/01/01b/min_stack.h
@@ -10,7 +10,7 @@ typedef struct {
 } Stack;
 
 Stack *initialize();
-int size(Stack *self);
 void push(Stack *self, int data);
-int min(Stack *self);
 int pop(Stack *self);
+int size(Stack *self);
+int min(Stack *self);
diff --git a/src/01/01b/min_stack_test.c b/src/01/01b/min_stack_test.c
index 77fb391..a02c163 100644
--- a/src/01/01b/min_stack_test.c
+++ b/src/01/01b/min_stack_test.c
@@ -1,17 +1,6 @@
 #include <cgreen/cgreen.h>
 #include "min_stack.h"
 
-/*
-   Design and implement a `MinStack` data structure that can store
-   comparable elements and supports the stack operations:
-
- * `push(x)`
- * `pop()`
- * `size()`
- * `min()`
- All operations should run in constant time.
-*/
-
 Describe(MinStack);
 BeforeEach(MinStack){ }
 AfterEach(MinStack){ }