Homework Clinic

Science Clinic => Computer Science => Programming and Graphic Design => Topic started by: K@ on May 22, 2019

Title: If a recursive algorithm does NOT contain a base case, it
Post by: K@ on May 22, 2019

If a recursive algorithm does NOT contain a base case, it
◦ returns false and stops
◦ reaches the recursive case and stops
◦ returns 0 and stops
◦ uses up all available stack memory, causing the program to crash
◦ None of these

Title: If a recursive algorithm does NOT contain a base case, it
Post by: JYan on May 22, 2019

uses up all available stack memory, causing the program to crash