From 75058e654aec7434eeb79ca2606f6dcc394ed6c8 Mon Sep 17 00:00:00 2001 From: Ronil Patil Date: Mon, 15 Apr 2024 10:15:21 +0530 Subject: [PATCH] fix(curriculum): typo in step 47 binary project (#54390) --- .../645cbb5ab1296e49946adb6e.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/curriculum/challenges/english/15-javascript-algorithms-and-data-structures-22/learn-recursion-by-building-a-decimal-to-binary-converter/645cbb5ab1296e49946adb6e.md b/curriculum/challenges/english/15-javascript-algorithms-and-data-structures-22/learn-recursion-by-building-a-decimal-to-binary-converter/645cbb5ab1296e49946adb6e.md index e91b1427f8a..4c31deb35df 100644 --- a/curriculum/challenges/english/15-javascript-algorithms-and-data-structures-22/learn-recursion-by-building-a-decimal-to-binary-converter/645cbb5ab1296e49946adb6e.md +++ b/curriculum/challenges/english/15-javascript-algorithms-and-data-structures-22/learn-recursion-by-building-a-decimal-to-binary-converter/645cbb5ab1296e49946adb6e.md @@ -9,7 +9,7 @@ dashedName: step-47 In computer science, a stack is a data structure where items are stored in a LIFO (last-in-first-out) manner. If you imagine a stack of books, the last book you add to the stack is the first book you can take off the stack. Or an array where you can only `.push()` and `.pop()` elements. -The call stack is a collection of function calls stored in a stack structure. When you call a function, it is added to the top or of the stack, and when it returns, it is removed from the top / end of the stack. +The call stack is a collection of function calls stored in a stack structure. When you call a function, it is added to the top of the stack, and when it returns, it is removed from the top / end of the stack. You'll see this in action by creating mock call stack.