Unit 10: Recursion

A dynamic data structure that allows you to store and manipulate collections of objects. Unlike arrays, ArrayLists can grow or shrink dynamically as needed.

A data structure that keeps track of function calls in a program. It stores information about the order and location of function calls, allowing the program to keep track of where to return after each function call is completed.

Refers to programming constructs or algorithms that involve repetition using loops. It allows for executing a block of code multiple times until certain conditions are met.

A programming technique where a function calls itself to solve a problem by breaking it down into smaller, similar subproblems.

Refers to the process of visiting and accessing each element in a data structure, such as an array or a tree, in a specific order.

A method in Java that creates and returns a new array containing elements from another array within specified range indexes (start index inclusive and end index exclusive).

An efficient algorithm used to locate a target value within a sorted array by repeatedly dividing the search interval in half.

The part of an algorithm where the solutions to smaller subproblems are combined or merged together to solve the original problem.

A strategy used in problem-solving algorithms where a complex problem is divided into smaller, more manageable subproblems.

Refers to the product of an integer and all the positive integers below it. For example, the factorial of 5 (written as 5!) is equal to 5 x 4 x 3 x 2 x 1.

An efficient, comparison-based sorting algorithm that divides an unsorted list into smaller sublists, sorts those sublists recursively, and then merges them back together to obtain a sorted list.

Another term for linear search, where each element in a list is checked one by one until the target value is found or the end of the list is reached.

Accessing each element of the array one by one, usually in a sequential manner.

When a function calls itself within its own code, allowing for repetitive execution of the same set of instructions.

The process of simplifying complex systems by breaking them down into smaller, more manageable parts. Method writing refers to defining behaviors or actions that an object can perform.

The process of evaluating the efficiency and performance of an algorithm. It involves analyzing factors such as time complexity, space complexity, and scalability to determine how well an algorithm will perform in different scenarios.

Step-by-step procedures or instructions for solving problems or performing tasks. They provide clear instructions on how to solve problems efficiently.

Refers to the development of computer systems capable of performing tasks that typically require human intelligence, such as speech recognition or decision-making and a subset of AI, that involves training algorithms on large datasets to make predictions or take actions without being explicitly programmed.

Programming constructs that determine the flow of execution in a program. They allow you to make decisions and repeat actions based on certain conditions.

A way of organizing and storing data in a computer so that it can be accessed and used efficiently. It provides a systematic way to manage and manipulate data.

Ways to organize, store, and manipulate data efficiently. They provide different methods of accessing, inserting, deleting, or searching for data elements based on specific requirements.

A branch of mathematics that deals with countable and distinct objects. It focuses on topics like sets, logic, relations, functions, and combinatorics.

The practice of hiding internal details and providing a public interface for interacting with an object. Class writing involves defining the blueprint or template for creating objects in object-oriented programming.

Involves creating visual representations using computers. It encompasses various techniques such as rendering 2D or 3D images, manipulating pixels, applying transformations, and simulating realistic effects like lighting and shadows.