# Study sets matching "algorithms"

Abstraction

Computational Thinking

Decomposition

Algorithmic Thinking

Representing 'real world' problems in a computer using variabl…

The use of computers to solve problems

Breaking down a large problem into smaller sub-problems.

Identifying the steps involved in solving a problem.

Abstraction

Representing 'real world' problems in a computer using variabl…

Computational Thinking

The use of computers to solve problems

Algorithm

Sequence

Selection

Iteration

a step-by-step procedure for solving problems

the order in which tasks are to be carried out

a question is asked, and depending on the answer, the program…

when a task is repeated until there is a required outcome

Algorithm

a step-by-step procedure for solving problems

Sequence

the order in which tasks are to be carried out

Bubble Sort

Quick Sort

Binary Search

First-Fit

1. Write out the the numbers/names given.... 2. Record only each…

1. Write down the list... 2. Select the pivot(mid point)... 3. Now w…

1. Use one of the sorting algorithms (quick sort or bubble sor…

1. Take the items in the order given ... 2. Place each item in th…

Bubble Sort

1. Write out the the numbers/names given.... 2. Record only each…

Quick Sort

1. Write down the list... 2. Select the pivot(mid point)... 3. Now w…

Searching Algorithms

Sorting Algorithms

String Manipulation

Iteration

A search algorithm is the step-by-step procedure used to locat…

In computer science a sorting algorithm is an algorithm that p…

Most programming languages that have a string datatype will ha…

In computational mathematics, an iterative method is a mathema…

Searching Algorithms

A search algorithm is the step-by-step procedure used to locat…

Sorting Algorithms

In computer science a sorting algorithm is an algorithm that p…

Isolate the lowest bit that is 1 in x

Replace the lowest bit that is 1 with 0

Right propagate the rightmost set bit i…

Compute x modulo a power of 2 (y)

x & ~(x - 1)

x & (x - 1)

x | (x & ~(x - 1) - 1)

x & (y - 1)

Isolate the lowest bit that is 1 in x

x & ~(x - 1)

Replace the lowest bit that is 1 with 0

x & (x - 1)

pseudo code

natural language

boolean condition

algorithm

is a kind of structured English for describing algorithms. It…

a language that has developed naturally in use (as contrasted…

compares two values to each other and then returns either a tr…

a set of steps; for a computer program to accomplish

pseudo code

is a kind of structured English for describing algorithms. It…

natural language

a language that has developed naturally in use (as contrasted…

Isolate the lowest bit that is 1 in x

Replace the lowest bit that is 1 with 0

Right propagate the rightmost set bit i…

Compute x modulo a power of 2 (y)

x & ~(x - 1)

x & (x - 1)

x | (x & ~(x - 1) - 1)

x & (y - 1)

Isolate the lowest bit that is 1 in x

x & ~(x - 1)

Replace the lowest bit that is 1 with 0

x & (x - 1)

Algorithm

Sequence

Selection

Iteration

a step-by-step procedure for solving problems

the order in which tasks are to be carried out

a question is asked, and depending on the answer, the program…

when a task is repeated until there is a required outcome

Algorithm

a step-by-step procedure for solving problems

Sequence

the order in which tasks are to be carried out

Isolate the lowest bit that is 1 in x

Replace the lowest bit that is 1 with 0

Right propagate the rightmost set bit i…

Compute x modulo a power of 2 (y)

x & ~(x - 1)

x & (x - 1)

x | (x & ~(x - 1) - 1)

x & (y - 1)

Isolate the lowest bit that is 1 in x

x & ~(x - 1)

Replace the lowest bit that is 1 with 0

x & (x - 1)

Abstraction

Computational Thinking

Decomposition

Algorithmic Thinking

Representing 'real world' problems in a computer using variabl…

The use of computers to solve problems

Breaking down a large problem into smaller sub-problems.

Identifying the steps involved in solving a problem.

Abstraction

Representing 'real world' problems in a computer using variabl…

Computational Thinking

The use of computers to solve problems

approximation

Sort only a few items

items are mostly sorted alredy

greedy

Instead of seeking an exact answer for a problem, accept solut…

Insertion sort

insertion sort

(selection sort)... convex hull

approximation

Instead of seeking an exact answer for a problem, accept solut…

Sort only a few items

Insertion sort

Algorithm

Sequence

Selection

Iteration

a step-by-step procedure for solving problems

the order in which tasks are to be carried out

a question is asked, and depending on the answer, the program…

when a task is repeated until there is a required outcome

Algorithm

a step-by-step procedure for solving problems

Sequence

the order in which tasks are to be carried out

Computational Thinking

Abstraction

Decomposition

Algorithmic Thinking

Computational thinking is a set of different techniques that c…

Abstraction is the process of picking out important bits of in…

Decomposition is the process of breaking down a problem into s…

Algorithmic thinking is a logical way of getting from a proble…

Computational Thinking

Computational thinking is a set of different techniques that c…

Abstraction

Abstraction is the process of picking out important bits of in…

Algorithm

Sequence

Selection

Iteration

a step-by-step procedure for solving problems

the order in which tasks are to be carried out

a question is asked, and depending on the answer, the program…

when a task is repeated until there is a required outcome

Algorithm

a step-by-step procedure for solving problems

Sequence

the order in which tasks are to be carried out

Definition of an Algorithms

Parts of an Algorithm

Algorithm Facts

Steps to Write an Algorithm

Series of steps to execute a behavior in a program. Studied fo…

Sequencing(steps), selection(conditions), iteration(repeat).

One problem can be solved by more than one algorithm. Can comb…

Make a plan using pseudocode and diagrams. Write code in compu…

Definition of an Algorithms

Series of steps to execute a behavior in a program. Studied fo…

Parts of an Algorithm

Sequencing(steps), selection(conditions), iteration(repeat).

Algorithm

Sequence

Selection

Iteration

a step-by-step procedure for solving problems

the order in which tasks are to be carried out

a question is asked, and depending on the answer, the program…

when a task is repeated until there is a required outcome

Algorithm

a step-by-step procedure for solving problems

Sequence

the order in which tasks are to be carried out

algorithm

parts of an algorithm

algorithm facts:

steps to write an algorithm:

a series of steps to execute a behavior in a program. They are…

sequencing (order of steps), selection (conditions that contro…

- one problem can be solved by more than one algorithm... - you c…

1. make a plan using pseudocode and diagrams... 2. Write the code…

algorithm

a series of steps to execute a behavior in a program. They are…

parts of an algorithm

sequencing (order of steps), selection (conditions that contro…

Linear Search

Binary Search

Recursion

Insertion Sort

A search algorithm that iterates linearly over a collection to…

uses a divide and conquer methodology to find what it's search…

When a function calls on itself.

Moves items from an unsorted collection to a new, sorted colle…

Linear Search

A search algorithm that iterates linearly over a collection to…

Binary Search

uses a divide and conquer methodology to find what it's search…

Quicksort

Mergesort

Heapsort

Insertion Sort

Best: O(n log(n))... Average: O(n log(n))... Worst: O(n^2)

Best: O(n log(n))... Average: O(n log(n))... Worst: O(n log(n))

Best: O(n log(n))... Average: O(n log(n))... Worst: O(n log(n))

Best: O(n)... Average: O(n^2)... Worst: O(n^2)

Quicksort

Best: O(n log(n))... Average: O(n log(n))... Worst: O(n^2)

Mergesort

Best: O(n log(n))... Average: O(n log(n))... Worst: O(n log(n))

Algorithm

Sequence

Selection

Iteration

a step-by-step procedure for solving problems

the order in which tasks are to be carried out

a question is asked, and depending on the answer, the program…

when a task is repeated until there is a required outcome

Algorithm

a step-by-step procedure for solving problems

Sequence

the order in which tasks are to be carried out

decomposition

algorithmic thinking

benefits of using an algorithm

abstraction

breaking down a complex problem down into smaller problems and…

a logical way of getting from the problem to the solution.

they can be reused and adapted to solve similar problems in th…

picking out the important bits of information from the problem…

decomposition

breaking down a complex problem down into smaller problems and…

algorithmic thinking

a logical way of getting from the problem to the solution.

Selection Sort

Merge Sort

Quick Sort

Counting Sort

Complexities:... Best: O(n²)... Average: O(n²)... Worst: O(n²)

Complexities:... Best: O(n log(n))... Average: O(n log(n))... Worst: O…

Complexities:... Best: O(n log(n))... Average: O(n log(n))... Worst: O…

Complexities:... Best: O(n + k)... Average: O(n + k)... Worst: O(n + k)

Selection Sort

Complexities:... Best: O(n²)... Average: O(n²)... Worst: O(n²)

Merge Sort

Complexities:... Best: O(n log(n))... Average: O(n log(n))... Worst: O…