Presentation is loading. Please wait.

Presentation is loading. Please wait.

Searching Tables.. Creating Pre-filled Tables A B C D E F G H I J K L ABCDEFGHIJKLM NOPQRSTUVWXYZ 01 LetterTable. 02 TableValues. 03 FILLER PIC X(13)

Published byHannah Fowler Modified over 9 years ago

Similar presentations

Presentation on theme: "Searching Tables.. Creating Pre-filled Tables A B C D E F G H I J K L ABCDEFGHIJKLM NOPQRSTUVWXYZ 01 LetterTable. 02 TableValues. 03 FILLER PIC X(13)"— Presentation transcript:

1 Searching Tables.

2 Creating Pre-filled Tables A B C D E F G H I J K L ABCDEFGHIJKLM NOPQRSTUVWXYZ 01 LetterTable. 02 TableValues. 03 FILLER PIC X(13) VALUE "ABCDEFGHIJKLM". 03 FILLER PIC X(13) VALUE "NOPQRSTUVWXYZ".

3 Creating Pre-filled Tables A B C D E F G H I J K L ABCDEFGHIJKLM NOPQRSTUVWXYZ 01 LetterTable. 02 TableValues. 03 FILLER PIC X(13) VALUE "ABCDEFGHIJKLM". 03 FILLER PIC X(13) VALUE "NOPQRSTUVWXYZ". 02 FILLER REDEFINES TableValues. 03 Letter PIC X OCCURS 26 TIMES. ABCDEFGHIJKLM NOPQRSTUVWXYZ 01 LetterTable. 02 TableValues. 03 FILLER PIC X(13) VALUE "ABCDEFGHIJKLM". 03 FILLER PIC X(13) VALUE "NOPQRSTUVWXYZ". 02 FILLER REDEFINES TableValues. 03 Letter PIC X OCCURS 26 TIMES.

4 Searching a Table 01 LetterTable. 02 TableValues. 03 FILLER PIC X(13) VALUE "ABCDEFGHIJKLM". 03 FILLER PIC X(13) VALUE "NOPQRSTUVWXYZ". 02 FILLER REDEFINES TableValues. 03 Letter PIC X OCCURS 26 TIMES. PERFORM VARYING Idx FROM 1 BY 1 UNTIL LetterIn EQUAL TO Letter(Idx) END-PERFORM. DISPLAY LetterIn, "is in position ", Idx. A B C D E F G H I J K L 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3 4 5 6 7 8 9 10 11 12

5 Search Syntax

6 SET Syntax

7 Searching a Table 01 LetterTable. 02 TableValues. 03 FILLER PIC X(13) VALUE "ABCDEFGHIJKLM". 03 FILLER PIC X(13) VALUE "NOPQRSTUVWXYZ". 02 FILLER REDEFINES TableValues. 03 Letter PIC X OCCURS 26 TIMES INDEXED BY LetterIdx. SET LetterIdx TO 1. SEARCH Letter AT END DISPLAY "Letter not found!" WHEN Letter(LetterIdx) = LetterIn DISPLAY LetterIn, "is in position ", Idx END-SEARCH. 01 LetterTable. 02 TableValues. 03 FILLER PIC X(13) VALUE "ABCDEFGHIJKLM". 03 FILLER PIC X(13) VALUE "NOPQRSTUVWXYZ". 02 FILLER REDEFINES TableValues. 03 Letter PIC X OCCURS 26 TIMES INDEXED BY LetterIdx. SET LetterIdx TO 1. SEARCH Letter AT END DISPLAY "Letter not found!" WHEN Letter(LetterIdx) = LetterIn DISPLAY LetterIn, "is in position ", Idx END-SEARCH. A B C D E F G H I J K L 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3 4 5 6 7 8 9 10 11 12

8 Searching a Two Dimension Table. 1 2 3 4 1 2 3 4 1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8 1 2 3 4 01 TimeTable. 02 Day OCCURS 5 TIMES INDEXED BY DayIdx. 03 Hours OCCURS 8 TIMES INDEXED BY HourIdx. 04 Item PIC X(10). 04 Location PIC X(10). SET DayIdx TO 0. PERFORM UNTIL MeetingFound OR DayIdx > 5 SET DayIdx UP BY 1 SET HourIdx TO 1 SEARCH Hours WHEN MeetingType = Item(DayIdx, HourIdx) SET MeetingFound TO TRUE DISPLAY MeetingType " on " DayIdx " at " HourIdx END-SEARCH END-PERFORM.

9 Search All Syntax.

10 Using the Search All 01 LetterTable. 02 TableValues. 03 FILLER PIC X(13) VALUE "ABCDEFGHIJKLM". 03 FILLER PIC X(13) VALUE "NOPQRSTUVWXYZ". 02 FILLER REDEFINES TableValues. 03 Letter PIC X OCCURS 26 TIMES ASCENDING KEY IS Letter INDEXED BY LetterIdx. SEARCH ALL Letter WHEN Letter(LetterIdx) = LetterIn DISPLAY LetterIn, "is in position ", Idx END-SEARCH. 01 LetterTable. 02 TableValues. 03 FILLER PIC X(13) VALUE "ABCDEFGHIJKLM". 03 FILLER PIC X(13) VALUE "NOPQRSTUVWXYZ". 02 FILLER REDEFINES TableValues. 03 Letter PIC X OCCURS 26 TIMES ASCENDING KEY IS Letter INDEXED BY LetterIdx. SEARCH ALL Letter WHEN Letter(LetterIdx) = LetterIn DISPLAY LetterIn, "is in position ", Idx END-SEARCH. A B C D E F G H I J K L 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3 4 5 6 7 8 9 10 11 12

11 How the Search All works. A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 ALGORITHM. Middle = (Lower + Upper) / 2 CASE TRUE WHEN Letter(Middle) < "Q" THEN Lower = Middle + 1 WHEN Letter(Middle) > "Q" THEN Upper = Middle -1 WHEN Letter(Middle) = "Q" THEN SET ItemFound TO TRUE WHEN Lower > Upper THEN ItemNotInTable TO TRUE 1 Lower 26 Upper 13M Middle = Letter(Middle)

12 How the Search All works. N O P Q R S T U V W X Y Z A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 ALGORITHM. Middle = (Lower + Upper) / 2 CASE TRUE WHEN Letter(Middle) < "Q" THEN Lower = Middle + 1 WHEN Letter(Middle) > "Q" THEN Upper = Middle -1 WHEN Letter(Middle) = "Q" THEN SET ItemFound TO TRUE WHEN Lower > Upper THEN ItemNotInTable TO TRUE 14 Lower 26 Upper 13M Middle = Letter(Middle)

13 How the Search All works. N O P Q R S T U V W X Y Z A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 ALGORITHM. Middle = (Lower + Upper) / 2 CASE TRUE WHEN Letter(Middle) < "Q" THEN Lower = Middle + 1 WHEN Letter(Middle) > "Q" THEN Upper = Middle -1 WHEN Letter(Middle) = "Q" THEN SET ItemFound TO TRUE WHEN Lower > Upper THEN ItemNotInTable TO TRUE 14 Lower 26 Upper 20T Middle = Letter(Middle)

14 How the Search All works. N O P Q R S A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 ALGORITHM. Middle = (Lower + Upper) / 2 CASE TRUE WHEN Letter(Middle) < "Q" THEN Lower = Middle + 1 WHEN Letter(Middle) > "Q" THEN Upper = Middle -1 WHEN Letter(Middle) = "Q" THEN SET ItemFound TO TRUE WHEN Lower > Upper THEN ItemNotInTable TO TRUE 14 Lower 19 Upper 20T Middle = Letter(Middle)

15 How the Search All works. N O P Q R S A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 ALGORITHM. Middle = (Lower + Upper) / 2 CASE TRUE WHEN Letter(Middle) < "Q" THEN Lower = Middle + 1 WHEN Letter(Middle) > "Q" THEN Upper = Middle -1 WHEN Letter(Middle) = "Q" THEN SET ItemFound TO TRUE WHEN Lower > Upper THEN ItemNotInTable TO TRUE 14 Lower 19 Upper 16P Middle = Letter(Middle)

16 How the Search All works. Q R S A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 ALGORITHM. Middle = (Lower + Upper) / 2 CASE TRUE WHEN Letter(Middle) < "Q" THEN Lower = Middle + 1 WHEN Letter(Middle) > "Q" THEN Upper = Middle -1 WHEN Letter(Middle) = "Q" THEN SET ItemFound TO TRUE WHEN Lower > Upper THEN ItemNotInTable TO TRUE 17 Lower 19 Upper 16P Middle = Letter(Middle)

17 How the Search All works. Q R S A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 ALGORITHM. Middle = (Lower + Upper) / 2 CASE TRUE WHEN Letter(Middle) < "Q" THEN Lower = Middle + 1 WHEN Letter(Middle) > "Q" THEN Upper = Middle -1 WHEN Letter(Middle) = "Q" THEN SET ItemFound TO TRUE WHEN Lower > Upper THEN ItemNotInTable TO TRUE 17 Lower 19 Upper 18R Middle = Letter(Middle)

18 How the Search All works. Q R S A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 ALGORITHM. Middle = (Lower + Upper) / 2 CASE TRUE WHEN Letter(Middle) < "Q" THEN Lower = Middle + 1 WHEN Letter(Middle) > "Q" THEN Upper = Middle -1 WHEN Letter(Middle) = "Q" THEN SET ItemFound TO TRUE WHEN Lower > Upper THEN ItemNotInTable TO TRUE 17 Lower 17 Upper 18R Middle = Letter(Middle)

19 How the Search All works. Q A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 ALGORITHM. Middle = (Lower + Upper) / 2 CASE TRUE WHEN Letter(Middle) < "Q" THEN Lower = Middle + 1 WHEN Letter(Middle) > "Q" THEN Upper = Middle -1 WHEN Letter(Middle) = "Q" THEN SET ItemFound TO TRUE WHEN Lower > Upper THEN ItemNotInTable TO TRUE 17 Lower 17 Upper 18Q Middle = Letter(Middle)

20 How the Search All works. Q A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 ALGORITHM. Middle = (Lower + Upper) / 2 CASE TRUE WHEN Letter(Middle) < "Q" THEN Lower = Middle + 1 WHEN Letter(Middle) > "Q" THEN Upper = Middle -1 WHEN Letter(Middle) = "Q" THEN SET ItemFound TO TRUE WHEN Lower > Upper THEN ItemNotInTable TO TRUE 17 Lower 17 Upper 18Q Middle = Letter(Middle)

21 Search All Example. Post Codes and Names 01 StateTable. 02 StateValues. 03 FILLER PIC X(20) VALUE ?????????????? Post Codes and Names 03 FILLER PIC X(20) VALUE ?????????????? 02 FILLER REDEFINES StateValues. 03 States OCCURS 50 TIMES ASCENDING KEY IS StateName INDEXED BY StateIdx. 04 PostCode PIC X(6). 04 StateName PIC X(14). SEARCH ALL States AT END DISPLAY "State not found" WHEN StateName(StateIdx) = InputName MOVE PostCode(StateIdx) TO PrintPostCode END-SEARCH. Post Codes and Names 01 StateTable. 02 StateValues. 03 FILLER PIC X(20) VALUE ?????????????? Post Codes and Names 03 FILLER PIC X(20) VALUE ?????????????? 02 FILLER REDEFINES StateValues. 03 States OCCURS 50 TIMES ASCENDING KEY IS StateName INDEXED BY StateIdx. 04 PostCode PIC X(6). 04 StateName PIC X(14). SEARCH ALL States AT END DISPLAY "State not found" WHEN StateName(StateIdx) = InputName MOVE PostCode(StateIdx) TO PrintPostCode END-SEARCH.

Download ppt "Searching Tables.. Creating Pre-filled Tables A B C D E F G H I J K L ABCDEFGHIJKLM NOPQRSTUVWXYZ 01 LetterTable. 02 TableValues. 03 FILLER PIC X(13)"

Similar presentations

The Important Thing About By. The Important Thing About ******** The important thing about ***** is *****. It is true s/he can *****, *****, and *****.

The Important Thing About By. The Important Thing About ******** The important thing about ***** is *****. It is true s/he can *****, *****, and *****.
Topic 14 Searching and Simple Sorts There's nothing in your head the sorting hat can't see. So try me on and I will tell you where you ought to be. -The.

Topic 14 Searching and Simple Sorts "There's nothing in your head the sorting hat can't see. So try me on and I will tell you where you ought to be." -The.
Lesson 8 Searching and Sorting Arrays 1CS 1 Lesson 8 -- John Cole.

Lesson 8 Searching and Sorting Arrays 1CS 1 Lesson 8 -- John Cole.
12-1 Structured COBOL Programming Nancy Stern Hofstra University Robert A. Stern Nassau Community College James P. Ley University of Wisconsin-Stout John.

12-1 Structured COBOL Programming Nancy Stern Hofstra University Robert A. Stern Nassau Community College James P. Ley University of Wisconsin-Stout John.
Chapter 12 Array Processing and Table Handling. Defining Series of Input Fields Coding record with 24 independent hourly fields is cumbersome 01Temp-Rec.

Chapter 12 Array Processing and Table Handling. Defining Series of Input Fields Coding record with 24 independent hourly fields is cumbersome 01Temp-Rec.
Let's learn the alphabet ! ABCDEFGHIJKLM NOPQRSTUVWXYZ.

Let's learn the alphabet ! ABCDEFGHIJKLM NOPQRSTUVWXYZ.
Advanced Tables.. 01 JeansTable. One Dimension Table.

Advanced Tables.. 01 JeansTable. One Dimension Table.
THE STENOTYPE MACHINE AND KEYBOARD.

THE STENOTYPE MACHINE AND KEYBOARD.
Copyright © 2012 Pearson Education, Inc. Chapter 8: Searching and Sorting Arrays.

Copyright © 2012 Pearson Education, Inc. Chapter 8: Searching and Sorting Arrays.
1 MEASURES OF CENTRAL TENDENCY AND DISPERSION AROUND THE MEDIAN.

1 MEASURES OF CENTRAL TENDENCY AND DISPERSION AROUND THE MEDIAN.
Search and Recursion CS221 – 2/23/09. List Search Algorithms Linear Search: Simple search through unsorted data. Time complexity = O(n) Binary Search:

Search and Recursion CS221 – 2/23/09. List Search Algorithms Linear Search: Simple search through unsorted data. Time complexity = O(n) Binary Search:
CS 106 Introduction to Computer Science I 03 / 07 / 2008 Instructor: Michael Eckmann.

CS 106 Introduction to Computer Science I 03 / 07 / 2008 Instructor: Michael Eckmann.
 2003 Prentice Hall, Inc. All rights reserved. 1 4.6Sorting Arrays Sorting data –Important computing application –Virtually every organization must sort.

 2003 Prentice Hall, Inc. All rights reserved Sorting Arrays Sorting data –Important computing application –Virtually every organization must sort.
Searching Arrays Linear search Binary search small arrays

Searching Arrays Linear search Binary search small arrays
Searching Arrays. COMP104 Array Sorting & Searching / Slide 2 Unordered Linear Search * Search an unordered array of integers for a value and save its.

Searching Arrays. COMP104 Array Sorting & Searching / Slide 2 Unordered Linear Search * Search an unordered array of integers for a value and save its.
Starting Out with C++: Early Objects 5/e © 2006 Pearson Education. All Rights Reserved Starting Out with C++: Early Objects 5 th Edition Chapter 9 Searching.

Starting Out with C++: Early Objects 5/e © 2006 Pearson Education. All Rights Reserved Starting Out with C++: Early Objects 5 th Edition Chapter 9 Searching.
Dictionary A template for an electronic dictionary.

Dictionary A template for an electronic dictionary.
Chapter 8 ARRAYS Continued

Chapter 8 ARRAYS Continued
12-1 COBOL for the 21 st Century Nancy Stern Hofstra University Robert A. Stern Nassau Community College James P. Ley University of Wisconsin-Stout (Emeritus)

12-1 COBOL for the 21 st Century Nancy Stern Hofstra University Robert A. Stern Nassau Community College James P. Ley University of Wisconsin-Stout (Emeritus)
PowerPoint Presentation: Richard H. Baum, Ph.D. DeVry Institute of Technology 9th Edition Structured COBOL Programming Nancy Stern Hofstra University Robert.

PowerPoint Presentation: Richard H. Baum, Ph.D. DeVry Institute of Technology 9th Edition Structured COBOL Programming Nancy Stern Hofstra University Robert.

Similar presentations

Ads by Google