17
Pseudocode(PC) Flowchart (FC)

Algorithm Flowchart

Embed Size (px)

DESCRIPTION

c

Citation preview

Page 1: Algorithm Flowchart

Pseudocode(PC)Flowchart (FC)

Page 2: Algorithm Flowchart

Ninex - PC

Gives the 9x of the input number

PROGRAM Ninex

PROMPT number

SET A = number

SET B = (number - 1)

SET C = 9 - B

SET Total = B*10 + C

PRINT Total

Alternate Psuedocode

Total = ((value - 1) * 10) + (9 - (value - 1))

Page 3: Algorithm Flowchart

NinexFC

Page 4: Algorithm Flowchart

Volleyball Scoring - PC

2 teams, wins at 15 points but must win by at least 2 points.

SET Game_Over = 0

WHILE (Game_over == 0)

IF ((Team1 > 14 OR Team2 > 14) AND (abs(Team1-Team2) >1))

THEN Game_Over = 1

ENDIF

ENDWHILE

*abs = absolute value, turn any negative number positive

Page 5: Algorithm Flowchart

Volleyball Scoring - FC

Page 6: Algorithm Flowchart

FizzBuzz - PC

If number divisible by 3 it’s a fizz, if by 5 it’s a buzz,if both fizzbuzz

PROGRAM FizzBuzz

SET A = 1

WHILE (A <= 100)

PRINT A

IF (A % 3 == 0)

THEN PRINT “Fizz”

ENDIF

IF (A % 5 == 0)

THEN PRINT “Buzz”

ENDIF

A = A+1

ENDWHILE

Page 7: Algorithm Flowchart

FizzBuzz - FC

Page 8: Algorithm Flowchart

Reverse An Array - PC

FUNCTION Reverse INPUT array

DECLARE result[array.length]

SET i = 0

SET x = result.length

WHILE (i < array.length)

result[x] = list[i]

i = i + 1

x = x - 1

ENDWHILE

RETURN result

Page 9: Algorithm Flowchart

Reverse an Array - FC

Page 10: Algorithm Flowchart

Palindrome - PC

Check if a word when reversed is still the same, eg.lol, wow

FUNCTION Palindrome INPUT string

SET A = 0

SET B = length(string) – 1

WHILE (A < B)

IF (string(A) != string(B))

RETURN False

ENDIF

A = A + 1

B = B - 1

ENDWHILE

RETURN True

Page 11: Algorithm Flowchart

Palindrome FC

Page 12: Algorithm Flowchart

Linear Search - PC

FUNCTION LinearSearch INPUT array, target

SET found = False

SET index = 0

WHILE ((found == False) AND (index < array.length))

IF array[index] == target

THEN found = true

ELSE

index = index + 1

ENDIF

ENDWHILE

RETURN found

Page 13: Algorithm Flowchart

Linear Search - FC

Page 14: Algorithm Flowchart

Binary Search - PCFUNCTION BinarySearch INPUT array, target

SET found = False

SET low = 0

SET high = array.length – 1

WHILE ((found == False) AND (low <= high))

SET index = (low + high) / 2

IF target == array[index]

THEN found = True

ELSE

IF target < array[index]

THEN high = index – 1

ELSE

low = index + 1

ENDIF

ENDIF

ENDWHILE

RETURN found

Page 15: Algorithm Flowchart

Binary Search - FC

Page 16: Algorithm Flowchart

Selection Sort - PCFUNCTION Sort INPUT array

SET eIndex = array.length

SET maxPos = 0

WHILE eIndex > 0

maxPos = CALL FindMax WITH array, eIndex

CALL SwapPos WITH array, maxPos, eIndex

eIndex = eIndex – 1

ENDWHILE

FUNCTION FindMax INPUT array, eIndex

SET biggest = 0

SET cIndex= 1

WHILE cIndex < eIndex

IF array[cIndex] > array[biggest]

THEN biggest = cIndex

ENDIF

cIndex = cIndex + 1

ENDWHILE

RETURN biggest

FUNCTION SwapPos INPUT array, eOne, eTwo

temp = array[eOne]

array[eOne] = array[eTwo]

array[eTwo] = temp

Page 17: Algorithm Flowchart

Selection Sort - FC