Algorithms http://cs.mst.edu What is an algorithm? An algorithm is - - PowerPoint PPT Presentation

▶
algorithms
SMART_READER_LITE
LIVE PREVIEW

Algorithms http://cs.mst.edu What is an algorithm? An algorithm is - - PowerPoint PPT Presentation

Oct 29, 2023 204 likes •310 views

Algorithms http://cs.mst.edu What is an algorithm? An algorithm is a clear, concise, and correct step- by-step sequence of actions used to solve a problem or set of problems http://cs.mst.edu Example 1 Problem Write an algorithm that

slide-1
SLIDE 1

http://cs.mst.edu

Algorithms

slide-2
SLIDE 2

http://cs.mst.edu

What is an algorithm?

  • An algorithm is a clear, concise, and correct step-

by-step sequence of actions used to solve a problem or set of problems

slide-3
SLIDE 3

http://cs.mst.edu

Example 1 Problem

  • Write an algorithm that describes how someone

is to sort a standard deck of cards from top to bottom as follows

  • 2 of clubs through the ace of clubs
  • 2 of diamonds through the ace of diamonds
  • 2 of hearts through the ace of hearts
  • 2 of spades through the ace of spades
slide-4
SLIDE 4

http://cs.mst.edu

Example 1 Solution

  • 1. choosing the top card of the stack in turn, make

4 new stacks of 13 cards, one stack for each suit

  • 2. with each of these four stacks, order the cards 2

through 10, jack, queen, king, ace

  • 3. combine the three stacks in this order: club,

diamond, heart, and spade

slide-5
SLIDE 5

http://cs.mst.edu

Example 2 Problem

  • Sorting a stack of papers, each with a number on

it

slide-6
SLIDE 6

http://cs.mst.edu

Example 2 Solution

  • 1. Compare the top two papers of the stack; place the

smaller valued paper on the bottom of the stack and keep the larger valued paper

  • 2. Grab the next paper off of the top of the stack and

compare it to the paper you kept; place the smaller of these two on the bottom of the stack and keep the larger

  • 3. Repeat step 2 until you have reached the (original)bottom
  • f the stack; you should now be holding the largest

valued paper in the stack; set this paper aside into a new “sorted stack”

  • 4. Repeat steps 1, 2 & 3, placing the paper from step 3 onto

the “sorted stack”, until no more papers remain

slide-7
SLIDE 7

http://cs.mst.edu

Algorithm Exercises

  • Write an algorithm for…
  • Tying your shoes
  • Telling time from an analogue clock
  • Helping 5 of your friends to find a lost key on a soccer

field

slide-8
SLIDE 8

http://cs.mst.edu

Applying algorithms to your coding problems

  • 1. Control Flow Charts - Some programmers prefer to

develop drawings showing how information passes from state to state in a solution.

  • 2. Pseudocode – You may develop your own

pseudocode language containing all the usual coding constructs of high-level languages and use it to write algorithms to solve your problem.

slide-9
SLIDE 9

http://cs.mst.edu

End of Session