USER FLOWCHART CATEGORY SELECTION

SEARCH AND PATTERN MATCHING

You can use these set of control logic to implement programs that do search and pattern matching on data values.

THE BINARY SEARCH ALGORITHM

The Binary Search does search to locate an item in a list consisting of N values in time proportional to Log₂(N). However, the data set must first be ordered for the algorithm to work. In comparison to the Linear Search algorithm, the average time taken to locate a single value depends on the manner in which the search data value is distributed within the set. Statistical analysis shows an expected search time of O(N)

THE LINEAR SEARCH ALGORITHM

In this implementation, the algorithm is actually been used to do search on a Company database system to extract related data whenever the user enters a company name. The essential part of this control logic that implement the linear search is highlighted red and is nested within the last outer loop of the control logic.

STRING SEARCH 1

STRING SEARCH 2

This is an overloaded version of the above algorithm. Hence, the control structure for both algorithms appear very similar. Use LogicCoder to quickly implement generic systems with minimal change.

INSERT A CHARACTER

This function inserts a character at a specified location in a given text string. The function test that the string array is of sufficient length for the insertion to be valid.

TEXT CHARACTER SHIFT

This function does right shifting of characters in a character string. The user specify the location where shifting is to begin, the number of positions to be shifted and the text array on which the shift is to take place. The function treat the character string as an array of character and do test to ensure that the shifting does not overshoot the character array length.

STRING HASING

This function generates hash key for individual string value in an array of strings.

PATTERN MATCHING

Looks for string pattern match in a larger string. Useful for Artificial Intelligence (AI) systems or image recognition and processing systems.

TEXT INDENTATION LAYOUT

This flowchart shows the algorithm for a program that takes a source program written in C++ and indents the text so that the control logic can be clearly seen and evaluated in its text format. The indentation is created only with the use of the space character. Hence, large code can become bulky in comparison to those that uses the tab character.

SORTING AND DATA ORDERING

Sorting and Data Ordering Algorithms. These are used to order data values in memory before other data processing operation is done on them.

BUBBLE SORT

This flowchart illustrates an instance implementation of the bubble sort algorithm. There are alternative flowcharts that gives a general implementation of this algorithm and can be used as a template.

SELECTION SORT

This program flowchart presented in a Ms Excel sheet is also an instance implementation of the Selection Sort algorithm. The algorithm has very similar control structure to that of Insertion Sort. Hence, a more general template can be used for the instance implementation of both algorithms.

INSERTION SORT

This flowchart implement a set of test to determine the average number of comparisons and data shift operation for the implementation of Insertion Sort. The algorithm does function call to the Insertion Sort and related functions.

QUICK SORT TEST

This flowchart implement a set of test to determine the average number of comparisons and data shift operation for the implementation of Quick Sort. The algorithm does function call to the Quick Sort and related functions. Actual implementation of Quick Sort algorithm is given in the next row.

QUICK SORT - TEST

This flowchart illustrates the logic used to do test to determine the average number of comparisons and data moves in the execution of the algorithm. The actual quick sort algorithm is given in another flowchart.

SHELL SORT - TEST

This flowchart illustrates the logic used to do test to determine the average number of comparisons and data moves in the execution of the algorithm. The actual Shell sort algorithm is given in another flowchart.

HEAP SORT - TEST

This flowchart illustrates the logic used to do test to determine the average number of comparisons and data moves in the execution of the algorithm. The actual heap sort algorithm is given in another flowchart.

STANDARD MERGE

This flowchart illustrates an algorithm used to code the movement of data during a standard merge operation. The algorithm is useful where large chunks of data are to be moved at one go or where input/output bottle-neck can have adverse effect on the overall performance of the merge operation. Used in a particular implementation of the in-place merge algorithm.

MERGE SORT

This flowchart presented in an Ms Excel spreadsheet illustrates the algorithm used to implement a merge-sort operation with use of the data movement encoded with data bits. Emphasis is on the Bit-merge algorithm.

RADIX SORT

SHUFFLE SORT -TEST

Algorithm to do test on Shuffle Sort to verify its operational performance on the number of comparisons and data moves. As with all test algorithms, this implementation makes function calls to the actual shuffle sort implementation and other service functions.

SHUFFLE SORT

Algorithm to do test on Shuffle Sort to verify its operational performance on the number of comparisons and data moves. As with all test algorithms, this implementation makes function calls to the actual shuffle sort implementation and other service functions.

BINARY TREE TRAVERSAL

This implementation of the Binary Tree traversal algorithm uses recursive calls to the implementation with a queue or stack. These two alternative implementations are not yet listed in this table.

DATABASE - DATA PROCESSING ALGORITHMS

Use the following sample program control algorithms to get solutions for your own data processing needs. Modify the flowchart to implement your own program solution and then use your flowchart to regenerate the source code to implement the solution. You can also use these control logic to get solution ideas or to develop general solution templates for your data processing needs.

CHEQUEING ACCOUNT

This flowchart illustrates the control logic used to create a monthly report on an individual chequeing account to show cheques written, their amount and the total of all cheques written during the month.

MILEAGE ALLOWANCE

This flowchart shows the control logic for a program that calculate allowance for the traveling expense of a sales person base on the amount of mileage done. The program uses information taken from a data file and is originally coded in BASIC but is also available in ANSI C++.

CLUB MEMBERS FEES

Determine fees that club members are required to pay base on their age. The system uses a data file of records to get information on individual members. Originally coded in BASIC but is also available in ANSI C++ source.

CAMPING FEES

Determine fees to be paid by campers depending on their residency and the number of days they have camped for.

TRAFFIC CITATION

The control logic for a program that iterate through a data file with information on traffic violation. The control logic for the implemented program does processing for the number of traffic violation and their associated fines and penalties.

FACILITIES RENTAL FEE

This algorithm determine rental fees base on different rate for the time spent in using computer facilities. Client records are kept in a database along with their time usage detail of the facilities. The program also computes total of all billed amount

HOSPITAL BILL

Here is the control logic for a function that calculates a hospital accommodation bill base on service type, patient care and patient accommodation room type. There are many other kinds of similar accommodation bill calculation services such as Hotel accommodation or Seminar accommodation or exhibition accommodation Note that this bill calculation routine uses sequential file with data stored in a database system.

THE CONTROL-BREAK LOGIC

You can modify the control-break logic so that it does any kind of switch in data processing pattern whenever a sequence of data values in a selected field(s) of records in a data file changes. The flowchart illustrated here is a simple example implementation of this system. However, you can use LogicCoder to do quick modification in more than one way to implement your own required control logic. For example, you can abstract section of the control logic and then replace the abstracted section with your own abstract control logic.

See flowchart in Ms Excel
Purchase LogicCoder
Price US$0.30

INVESTMENT CALCULATION

This algorithm shows a program that will do investment calculation on returns base on the initial amount invested, the expected return rate and the years of investment. You can get the flowchart as a logiccoder document file with both description and source command statements. You can then regenerate the original source code or edit the control logic with their command statements to generate another similar program. You can also generate another program in any other programming language supported by logiccoder.

TELEPHONE KIOSK

Here is the flowchart for a program that operates user access and use of a telephone kiosk. The program controls the user entry of coins to make the call and the time duration of the call base on the type of call and the amount entered by the user. Use logiccoder to edit and regenerate this program in different languages or just to document its implementation and operation.

DO-WHILE LOOP IMPLEMENTAION

Here is a sample implementation of the Do-While loop taken from a C++ source code. The flowchart control logic was extracted with the use of LogicExtractor as a test. LogicExtractor can also extract the control logic for large source files that has other structures such as switch-case statements. I will show you other test extractor to demonstrate the capabilities and limits of LogicExtractor and LogicCoder.

ALGORITHMS FOR MATHEMATICS AND STATISTICS

Algorithms for doing mathematical and statistic operations. Use these algorithms as routines in more complex mathematical systems or do modifications to meet your requirements.

FIND THE AVERAGES

This flowchart illustrates the logic to be used in a program that determine the Mean, Mode, and Median of a set of ordered data values structured as an array. The algorithm can be easily modified so that it determine the minimum and maximum values in the data set.

MATRICES SYMETRY

This flowchart illustrates the control logic used in a computer program to determine if a matrix with regular diagonal elements is symmetrical or not.

GREATEST COMMON DIVIDOR

Determine the greatest common divider of a pair of integer values U and V. This algorithm uses the Euclid method.

GET PRIME NUMBERS BETWEEN RANGE

Select the set of prime numbers between a range of values. I have not spent enough time to determine the actual running time of this implementation but it appears 'trivial from first sight'.

FABONACI NUMBER

Determine the Fabanocci number for

FRACTAL

Does recursive calculation on a given shape parameter values and then draw the shapes recursively at given point along selected parameters on the shape boundary. In this case, the shape is a box.

ADJACENY MATRIX

This flowchart illustrates the control logic to be used for getting the adjacency matrix from a graph specified as edges and vertices. The implementation is base on standard algorithm given in the text books.

CONTROL LOGIC FOR SPATIAL GEORMETRY

This is a relatively new field in Theoretical Computer Science and therefore has a lot of implication in areas of Engineering and Mathematics. Here I have researched and list a set of algorithms for doing operations on data that represents spatial geometrical objects or systems. I have actually used some of these algorithms in this LogicCoder to do object layout and manipulation.

RECTANGULAR ENCLOSURE

Determine the rectangular area of a screen display that encloses a set of points or objects represented as a polygon in an array. Notice how similar this algorithm is to the maximum/minimum selection algorithm given at Max/Min select. In fact, this algorithm is just a 2-dimensional representation of the same.