#1 designandanalysis of algo
Download as PPTX, PDF3 likes1,190 views
1) Initialize the largest variable to the first element of the array 2) Iterate through the rest of the array using a while loop 3) Compare each element to the largest and update largest if a larger number is found 4) After iterating through the entire array, largest will hold the largest element
![Do this…………Design an algorithm that will find the largest number in an array ss[1],s[2],…,s[n]Note: an array is a group of data of the same typeUse while](https://image.slidesharecdn.com/1designandanalysisofalgo-100705000806-phpapp01/85/1-designandanalysis-of-algo-22-320.jpg)
#1 designandanalysis of algo
- 1. Design And Analysis of AlgorithmsTopic #1: Algorithm BasicsPrepared by: BrijidaCharizma A. Navarro
- 2. IntroductionAs future computer scientists, you will usually more concerned with writing complex program algorithm.
- 3. AlgorithmsStep by step method of solving some problemsSolution that can be executed by a computerDerived from the name of the nith-century Persian mathematician al-Khowarizmi.
- 4. AlgorithmA complete, step-by-step procedure for solving a specific problem.
- 5. Pakiisipnga…..Does the computer understand an algorithm?
- 7. Properties of AlgorithmsDeterminismFiniteness CorrectnessGenerality
- 8. ExampleMake an algorithm that finds the maximum of three numbers a, b and c.
- 9. Algorithm: Finding the maximum in a list of 3 numbersa = 1, b = 5,c = 3x = aIf b > x then x = bIf c > x, then x=c.
- 10. Two Main Tasks in the Study of AlgorithmsAlgorithm DesignAnalysis of Algorithms
- 11. Algorithm DesignTo solve problemsAn art more than a science
- 12. Analysis of AlgorithmsWill provide insights into designing new algorithms
- 13. in analysis of algorithms, we ask ourselves the following questions:Correctness.Given an algorithm for a problem, does it solve the problem?Termination. Does the algorithm always stop after a finite number of steps?Time Analysis. How many instructions does the algorithm execute?Space Analysis. How much memory does the algorithm need to execute?
- 14. ExerciseWrite an algorithm that finds the smallest element among a, b and c
- 15. Solutionx = aIf b < x, then x = b.If c < x, then x = c.
- 16. 2. ExerciseWhich properties of an algorithm – input, output, precision, determinism, finiteness, correctness, generality – if any, are lacking in the following. Explain. The input is a set of S of integers and an integer m. The output is all subsets of S that sum to m.
- 17. Here’s the algorithm:List all subsets of S and their sums.Proceed through the subsets listed in step 1 and output each whose sum is m.
- 18. Answer:If the set S is an infinite set, the algorithm will not terminate, so it lacks finiteness and output properties.Line 1 is not precisely stated since how to list the subsets of S and their sums is not specified; thus the algorithm lacks the precision property.The order of the subsets listed in line 1 depends on the method used to generate them, so the algorithm lacks the determinism property.Since line 2 depends on the order of the subsets generated in line 1, the determinism property is lacking here as well.
- 19. Pseudocode for AlgorithmsMade of ordinary languagePrecision, structure and universalityClosely resembles the actual code of computer languages such as C++ and JavaAny version of pseudocode is acceptable as long as the instructions are unambiguous.
- 20. Algorithm StructureAlgorithm: Finding the Maximum of Three Numbers. This algorithm finds the largest of the numbers a, b, and cInput Parameters: a, b, cOutput Parameter: xmax(a,b,c){ x = a if (b > x) // b is larger than x, update x x = b if (c > x) // c is larger than x, update x x = c}
- 21. TitleBrief description of the algorithmThe input and output parametersFunction containing the instructions of the algorithm
- 22. Do this…………Design an algorithm that will find the largest number in an array ss[1],s[2],…,s[n]Note: an array is a group of data of the same typeUse while