Loading presentation...

Present Remotely

Send the link below via email or IM

Copy

Present to your audience

Start remote presentation

  • Invited audience members will follow you as you navigate and present
  • People invited to a presentation do not need a Prezi account
  • This link expires 10 minutes after you close the presentation
  • A maximum of 30 users can follow your presentation
  • Learn more about this feature in our knowledge base article

Do you really want to delete this prezi?

Neither you, nor the coeditors you shared it with will be able to recover it again.

DeleteCancel

Algorithms

No description
by

George Robert-Shaw

on 17 January 2017

Comments (0)

Please log in to add your comment.

Report abuse

Transcript of Algorithms

Linear Search Algorithm
Simply involves searching through a set of data, one after another, until the data is found.
Example
Searching for the letter 'D'

Index 0 1 2 3 4 5 6
Item A F B E D G C

Will set up to cycle through each index of the array. If it finds the 'D', it will stop and display the location
Binary Search Algorithm
Can only be used if data is in order. Starts in the middle of index and works out if the item is lower than the middle ore higher.
If it is located lower then the search is narrowed to the first half and the same if higher.
It repeats this process with the smaller chunk of data until item is found
Faster than linear
Thank you!
What do they do?
Used to find items of data

Two common search algorithms:
Linear
Binary
Searching Algorithms
Example
Searching for the letter 'D'

Index 0 1 2 3 4 5 6 7 8
Item A B C D E F G H I

Will identify 'E' as the middle. 'E' is higher than 'D'. Lower search are. Repeat until 'D' is found
Full transcript