Busy. Please wait.
or

show password
Forgot Password?

Don't have an account?  Sign up 
or

Username is available taken
show password

why


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.
We do not share your email address with others. It is only used to allow you to reset your password. For details read 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.

Remove Ads
Don't know
Know
remaining cards
Save
0:01
To flip the current card, click it or press the Spacebar key.  To move the current card to one of the three colored boxes, click on the box.  You may also press the UP ARROW key to move the card to the "Know" box, the DOWN ARROW key to move the card to the "Don't know" box, or the RIGHT ARROW key to move the card to the Remaining box.  You may also click on the card displayed in any of the three boxes to bring that card back to the center.

Pass complete!

"Know" box contains:
Time elapsed:
Retries:
restart all cards




share
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