Tips and tools for creating and presenting wide format slides Algorithms Tips and tools for creating and presenting wide format slides

What is an algorithm? How can we represent an algorithm? - pseudocode - flowcharts

What is an algorithm? A series of steps that can followed to solve a problem An algorithm should include actions to be performed, and the order in which they are done. How can we represent an algorithm? - pseudocode - flowcharts

How can we represent an algorithm? - pseudocode - flowcharts

Flowcharts START Flowcharts begin with START and finish with an END. These are called terminators. A parallelogram indicates an INPUT or OUTPUT. A rectangle is used to show a PROCESS to be carried out. A diamond indicates a DECISION between two or more possible pathways. INPUT PROCESS DECISION NO YES OUTPUT END

The BBQ TOMATO SAUCE NO YES START GET BREAD SAUCE? GET PATTIE ONIONS? NO GET TOMATO SAUCE GET BBQ SAUCE YES EAT HAMBURGER GET ONIONS END

Some classic algorithms Search algorithms e.g. Linear (sequential) Bozo Binary Sort algorithms e.g. Selection Insertion Bubble Merge Quicksort

Linear search (sequential search) Check if the first item in a list is the item you are searching for, if it is the one you are looking for, you are done. If it isn’t the item you are searching for move on and check the next item. Continue checking items until you find the one you are searching for.

Bozo Select an item at random. If it is the one you are looking for, then finish. Otherwise continue checking items until you find the one you are searching for Note: Even worse than linear! (Could end up checking the same item repeatedly!)

Binary Search Look at the item in the centre of the list and compare it to what you are searching for If it is what you are looking for then you are done. If it is larger than the item you are looking for then you can ignore all the items in the list which are larger than that item (if the list is from smallest to largest this means you can ignore all the items to the right of the centre item). If it is smaller then you can ignore all the items in the list which are smaller than that centre item. Now repeat the algorithm on the remaining half of the list, checking the middle of the list and choosing one of the halves, until you find the item you are searching for.

Selection Find the smallest item in the list and place it to one side. This will be your sorted list. Next find the smallest item in the remaining list, remove it and place it into your sorted list beside the item you previously put to the side. Repeat this process until all items have been selected and moved into their correct position in the sorted list.

Bubble sort Compare the first two items, swap them if they’re in the wrong order. Repeat this for each (overlapping) pair of items until the end of the list is reached. Repeat the entire process until the list is sorted (i.e. no more swaps are necessary)

Merge sort If the list has one item, finish. Otherwise, divide the list at random into two equal size (or nearly equal if there’s an odd number of items) Sort each of the half-lists (using merge sort...) Merge the sorted lists by repeatedly removing the smaller of the smallest item from each list.

Insertion Take an item from your unsorted list and place it to the side, this will be your sorted list. One by one, take each item from the unsorted list and insert it into the correct position in the sorted list. Do this until all items have been sorted.

Quicksort Choose an item from the list and compare every other item in the list to this (this item is often called the pivot). Place all the items that are greater than it into one subgroup and all the items that are smaller into another subgroup. Place the pivot item in between these two subgroups. Choose a subgroup and repeat this process. Eventually each subgroup will contain only one item and at this stage the items will be in sorted order.

References http://www.csfieldguide.org.nz/Algorithms.html http://www.sorting-algorithms.com/

Widescreen Pictures Pictures can also be presented more dramatically in widescreen.

Creating 16:9 Presentations To setup a widescreen presentation, do one of the following: Start with this template. Simply delete the example slides and add your own content. Or, on the Themes tab, under Page Setup, click Slide Size, and then click Widescreen (16:9). (Note: we also support 16:10, which is a common widescreen laptop resolution. ) Important: Always start with your slide size set to the aspect ratio you intend to use. If you change the slide size after you’ve created some slides, your pictures and other graphics will be resized. This could potentially distort their appearance.

Slide Show Tips To present in true widescreen, you’ll need a computer and, optionally, a projector or flat panel that can output widescreen resolutions. Common computer widescreen resolutions are 1280 x 800 and 1440 x 900. (These are 16:10 aspect ratio, but will work well with 16:9 projectors and screens.) Standard high definition televisions resolutions are1280 x 720 and 1920 x 1080. Use the Test Pattern on the next slide to verify your slide show settings.

Widescreen Test Pattern (16:9) Aspect Ratio Test (Should appear circular) 4x3 16x9