Add spacing

2 files changed, 5 insertions, 0 deletions

diff --git a/assignments/01/priority_queue.c b/assignments/01/priority_queue.c
index 9ec7721..69c00d6 100644
--- a/assignments/01/priority_queue.c
+++ b/assignments/01/priority_queue.c
@@ -2,6 +2,7 @@
 #include <stdlib.h>
 #include "priority_queue.h"
 
+// https://en.wikipedia.org/wiki/Priority_queue
 PriorityQueue *initialize() {
   PriorityQueue *queue = malloc(sizeof(PriorityQueue));
   queue->size = 0;
diff --git a/assignments/01/priority_queue_test.c b/assignments/01/priority_queue_test.c
index 532daf6..210d9b6 100644
--- a/assignments/01/priority_queue_test.c
+++ b/assignments/01/priority_queue_test.c
@@ -21,6 +21,7 @@ Ensure(PriorityQueue, returns_size) {
   PriorityQueue *queue = initialize();
 
   assert_that(size(queue), is_equal_to(0));
+
   destroy(queue);
 }
 
@@ -31,6 +32,7 @@ Ensure(PriorityQueue, adds_a_node) {
   add(queue, node);
 
   assert_that(size(queue), is_equal_to(1));
+
   destroy(queue);
 }
 
@@ -53,8 +55,10 @@ Ensure(PriorityQueue, removes_the_node_with_the_lowest_priority){
 
 TestSuite *priority_queue_tests() {
   TestSuite *suite = create_test_suite();
+
   add_test_with_context(suite, PriorityQueue, returns_size);
   add_test_with_context(suite, PriorityQueue, adds_a_node);
   add_test_with_context(suite, PriorityQueue, removes_the_node_with_the_lowest_priority);
+
   return suite;
 }