From 76e80dbd9a212f30718afd884993f82fa0970e5c Mon Sep 17 00:00:00 2001 From: Andrew Lalis Date: Mon, 22 May 2017 15:36:54 +0200 Subject: [PATCH] fixed some more with the readme --- README.md | 12 ++++++------ 1 file changed, 6 insertions(+), 6 deletions(-) diff --git a/README.md b/README.md index 7cf1f2e..c69bbcd 100644 --- a/README.md +++ b/README.md @@ -4,12 +4,12 @@ A handy collection of C algorithms compiled into one header file for use anywher ## Functionality ### Stack -The stack is probably the most basic storage structure, using the 'first-in, first-out' approach. -* ```c Stack createStack()``` -* ```c void freeStack(Stack *s)``` -* ```c void pushToStack(int item, Stack *s)``` -* ```c int popFromStack(Stack *s)``` -* ```c void printStack(Stack s)``` +The stack is probably the most basic storage structure, using the 'first-in, first-out' approach. The following functions are the only ones available for stack manipulation, as it is quite a minimalistic data structure. +* ``` Stack createStack() ``` +* ``` void freeStack(Stack *s) ``` +* ``` void pushToStack(int item, Stack *s) ``` +* ``` int popFromStack(Stack *s) ``` +* ``` void printStack(Stack s) ``` ### Queue