From 1ccc72c16df96ec6b06696323f40bb59fb43c8aa Mon Sep 17 00:00:00 2001 From: Andrew Lalis Date: Mon, 22 May 2017 15:34:36 +0200 Subject: [PATCH] trying out the code in readme --- README.md | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/README.md b/README.md index 03eaf20..7cf1f2e 100644 --- a/README.md +++ b/README.md @@ -5,11 +5,11 @@ A handy collection of C algorithms compiled into one header file for use anywher ### Stack The stack is probably the most basic storage structure, using the 'first-in, first-out' approach. -* Stack createStack() -* void freeStack(Stack *s) -* void pushToStack(int item, Stack *s) -* int popFromStack(Stack *s) -* void printStack(Stack s) +* ```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)``` ### Queue