Save
Busy. Please wait.
Log in with Clever
or
show password
Forgot Password?
Don't have an account?  Sign up 
Sign up using Clever
or
Username is available taken
show password


Make sure to remember your password. If you forget it there is no way for StudyStack to send you a reset link. You would need to create a new account. Your email address is only used to allow you to reset your password. See our Privacy Policy and Terms of Service.

Already a StudyStack user? Log In

Reset Password
Enter the associated with your account, and we'll email you a link to reset your password.
focusNode
Didn't know it?
click below
 
Knew it?
click below
Don't Know
Remaining cards (0)
Know
0:00
edit
Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.

  Normal Size     Small Size show me how

WJEC CG3.5 & 3.7

Topics 5 & 7: Algorithms and Logical Operations

QuestionAnswer
Insertion sort Items are copied one by one from the input (array) to the output (array); Each new item is inserted in the correct place in the output.
Bubble sort A pass is made through the data, comparing each value with the following one and swapping them if necessary. A number of passes is made until the data is in order.
Defining algorithms Structured English; flowcharts; pseudo-code.
ByValue local copy of the data is created for the procedure (discarded later)
ByReference the address of the required data is passed to the procedure (rather than the actual value of the data)
Recursive Algorithm A recursive algorithm is one which calls itself. It must also have a “base case” to allow it to terminate. Example: Binary search; Quicksort; Traversing binary tree; Factorial calculation; Towers of Hanoi; Fibonacci calculation.
Standard Module is one which carries out a standard task. It is pre-written / pre-tested and may be supplied with the language. The benefits include the fact that the standard module has already been written, which saves time and effort. It has also been tested.
Quicksort (description) An item/pivot selected (which item is unimportant) Condone “middle”; Produce two new lists of smaller and larger numbers; Repeat above points on new sub lists (recursively) until sorted.
Created by: mcounsell
Popular Computers sets

 

 



Voices

Use these flashcards to help memorize information. Look at the large card and try to recall what is on the other side. Then click the card to flip it. If you knew the answer, click the green Know box. Otherwise, click the red Don't know box.

When you've placed seven or more cards in the Don't know box, click "retry" to try those cards again.

If you've accidentally put the card in the wrong box, just click on the card to take it out of the box.

You can also use your keyboard to move the cards as follows:

If you are logged in to your account, this website will remember which cards you know and don't know so that they are in the same box the next time you log in.

When you need a break, try one of the other activities listed below the flashcards like Matching, Snowman, or Hungry Bug. Although it may feel like you're playing a game, your brain is still making more connections with the information to help you out.

To see how well you know the information, try the Quiz or Test activity.

Pass complete!
"Know" box contains:
Time elapsed:
Retries:
restart all cards