6.1 ALGORITHM

STEP 1:-

Start

STEP 2:-

Load a file or write a c++ code in text editor.

Select file Using (OpenFileDialog op = new OpenFileDialog () ;)
If (C++ File EXIST)
{
LOAD FILE IN TEXT EDITOR(c++ file);
}

STEP 3

Setting up each line in SFC Table.

If (Text Editor != "")
{
Add rows in SFC table (LENGTH OF TOTAL NO. LINES);
For (int i = 0; i < LENGTH OF TOTAL NO. LINES; i++)
{
{
ROW OF SFC TABLE[i].CELLS OF SFC TABLE [0].Value = i + 1;
ROWS OF SFC TABLE[i].CELLS OF SFC TABLE [1].Value = TOTAL LINES OF TEXT EDITOR[i];
}
}
Else
{
SHOW MSG ("First load/write or select an algorithm.", "Text editor is empty");
}

STEP 4

Each line will then be checked and according to its syntax, a primitive steps, frequency (min and max) and count …show more content…
Best case, Average case and Worst case will show the efficiency of algorithm of sorted array, unsorted array and array in descending order.

7. Summary will provide the result of overall testing.

6.3 COMPLEXITY

6.3.1 WORST CASE

1 + 1 + 1 + 1 + N + N + 1 + N + N + 5N + N + N + 5N + N + N + 5N + N + N + 6N + N + N + N + N + N + N + N + N + N + N + N + N + N + N + N + 1

Worst Case = 6 + 46N

6.3.2 BEST CASE

1 + 1 + 0 + 0 + 0 + 0 + 0 + N + N + 0 + N + N + 0 + N + N + 0 + 0 + N + 0 + N + N + 0 + N + N + 0 + N + N + 0 + N + N + 0 + N + N + 0 + 1

Best Case = 3 + 17N

6.3.3 ANALYSIS OF ALGORITHMS W.R.T. DISTINCTION

There are three types of cases to represents the complexity of “Complexity Analyzer”.
• Best Case
• Worst Case
• Average Case
6.3.3.1 BEST CASE

There are inputs considered in which the maturities are minimal. The running time in worst case is a lower bound on the running time. Basically in the Best-case defines the lower bound on running time of an algorithm. We need to know about the case that causes smallest number of actions to be implemented. The best-case analysis is rarely performed.

Best Case is equal to the first element in the array is searched  Number of comparisons is V (n) = 1

FOR