0
Upcoming SlideShare
×

Thanks for flagging this SlideShare!

Oops! An error has occurred.

×
Saving this for later? Get the SlideShare app to save on your phone or tablet. Read anywhere, anytime – even offline.
Standard text messaging rates apply

# MELJUN CORTES Algorithm Lecture

205

Published on

MELJUN CORTES Algorithm Lecture

MELJUN CORTES Algorithm Lecture

0 Likes
Statistics
Notes
• Full Name
Comment goes here.

Are you sure you want to Yes No
• Be the first to comment

• Be the first to like this

Views
Total Views
205
On Slideshare
0
From Embeds
0
Number of Embeds
0
Actions
Shares
0
10
0
Likes
0
Embeds 0
No embeds

No notes for slide

### Transcript

• 1. ALGORITHMS An algorithm is any well defined computational procedure that takes some values, or set of values as input and produce some value as output. An algorithm is thus a sequence of computational steps that transform the input into output.MELJUN CORTES01/08/13 1
• 2. In addition all algorithm must follow Following criteria: Input: Zero or more quantities are externally supplied . Output: At least one quantity is produced. certainty: Each instruction must be clear and unambiguous. Finiteness: An algorithm must terminates out after a finite number of steps. Effectiveness: Every instruction must be very basic so that it can be carried out.01/08/13 2
• 3. Analyzing Algorithms Analyzing an algorithm mean predicting the resources that the algorithm requires . Occasionally resources such as memory, communication bandwidth, or computer hardware are of primary concern, but most often it is computational time we want to measure. In other words The theoretical study of computer-program performance and resource usage.01/08/13 3
• 4. Analysis of algorithms What&#x2019;s more important than performance? &#x2022; modularity &#x2022; correctness &#x2022; maintainability &#x2022; functionality &#x2022; robustness &#x2022; user-friendliness &#x2022; programmer time &#x2022; simplicity &#x2022; extensibility &#x2022; reliability01/08/13 4
• 5. Why study algorithms and performance ? &#xF0A1; Algorithms help us to understand scalability. &#xF0A1; Performance often draws the line between what is feasible and what is impossible. &#xF0A1; Algorithmic mathematics provides a language for talking about program behavior. &#xF0A1; The lessons of program performance generalize to other computing resources.01/08/13 5
• 6. Running time &amp; Input size The running time of an algorithm on a particular input is the number of primitive operations or &#x201C;steps&#x201D; executed. The best notation for &#x201C;input size&#x201D; depends on the problem being studied. For example: In sorting or computing discrete Fourier transforms the most natural measure is the no. of item in the input For example the array size n for sorting. On the other hand in multiplying two integers the best measure is the total no. of bits needed to represent the input in ordinary binary notation .01/08/13 6
• 7. &#x2022; The running time depends on the input: an already sorted sequence is easier to sort. &#x2022; Parameterize the running time by the size of the input, since short sequences are easier to sort than long ones. &#x2022; Generally, we seek upper bounds on the running time, because everybody likes a guarantee.01/08/13 7
• 8. Complexity of Algorithm The complexity of an algorithm M is the functionf(n) which give the running time and/or storage space requirement of the algorithm in term of the size n of input data. Frequently storage space required by an algorithm is simply a multiple of data size n. Accordingly, unless or otherwise stated the term &#x201C;complexity&#x201D; will refer to running time of an algorithm.01/08/13 8
• 9. Cases for complexity function Worst case :The maximum value of f(n) for any possible input. Average case: the expected value of f(n). Best case: Sometimes we consider minimum possible value of f(n) called the best case.01/08/13 9
• 10. Asymptotic notation &#xF0A7; Theta notation(&#x398;) &#xF0A7; Big oh notation(O) &#xF0A7; Small oh notation(o) &#xF0A7; Omega notation (&#x3A9;) &#xF0A7; Little omega notation (&#x3C9;)01/08/13 10
• 11. Theta notation (&#x398;) For a given function g(n), we denote &#x398;(g(n))={f(n): there exist positive constant C1,C2 and n0 such that 0 &#x2264; C1g(n) &#x2264; f(n) &#x2264; C2g(n)for all n&#x2265; n001/08/13 11
• 12. f(n) = &#x398;(g(n)) C2(g(n)) f(n) C1(g(n)) n0 n01/08/13 12
• 13. Big oh notation(O) The theta &#x2013;notation asymptotically bounds a function from above and below. When we have only an asymptotically upper bound , We use O-notation. For a given function g(n), we denote by Og(n) the set of functions Og(n)= {f(n): there exist positive constant C and n0 such that 0 &#x2264; f(n) &#x2264; Cg(n) for all n&#x2265; n001/08/13 13
• 14. f(n) = O(g(n)) f(n) = O(g(n)) C(g(n)) f(n) n n001/08/13 14
• 15. Omega notation(&#x3A9;) Just as O-notation provides an asymptotic upper bound on a function, &#x3A9; notation provide an asymptotic lower bound For a given function g(n), we denote by &#x3A9;(g(n)) the set of functions &#x3A9;(g(n))={f(n): there exist positive constant C and n0 such that 0 &#x2264; Cg(n) &#x2264; f(n) for all n&#x2265; n0 }01/08/13 15
• 16. f(n)=&#x3A9;(g(n)) f(n)=&#x3A9;(g(n)) f(n) C(g(n)) no n01/08/13 16
• 17. Small oh notation(o) The asymptotic upper bound provided by O- notation may or may not be asymptotically tight, but the bound o-notation to denote an upper bound that is not asymptotically tight. We formally define o(g(n)) as the set Og(n)= {f(n): for any constant c&gt;0 there exist a constant C &gt;0and n0 &gt;0 such that 0 &#x2264; f(n) &lt; Cg(n) for all n&#x2265; n0 }01/08/13 17
• 18. Little omega notation (&#x3C9;) By analogy &#x3C9;- notation is to &#x3A9;-notation is same as o notation to O- notation. We use &#x3C9;- notation to denote a lower bound that is not asymptotically tight . It is defined by : f(n) &#x404; &#x3C9;(g(n)) iff g(n) &#x404; o(f(n)) Formally we defined &#x3C9;(g(n)) as the set &#x3C9;(g(n))={ f(n) : for any positive constant c&gt;0, there exists a constant n0 &gt;0such that 0 &#x2264; c(g(n)) &lt; f(n) for all n&#x2265;n0 }01/08/13 18
• 19. Comparison of function01/08/13 19
• 20. Reflexivity f(n) = &#x398;(f(n)) f(n) = O(f(n)) f(n) = &#x3A9;(f(n))01/08/13 20
• 21. Symmetry f(n) = &#x398;(g(n)) iff g(n) = &#x398;(f(n))01/08/13 21
• 22. Transitivityf(n) = &#x398;(g(n)) and g(n) = &#x398;(h(n)) imply f(n)= &#x398;(g(n))f(n) = O(g(n)) and g(n) = O(h(n)) imply f(n)= O(g(n))f(n) = &#x3A9; (g(n)) and g(n) = &#x3A9;(h(n)) imply f(n)= &#x3A9;(g(n))f(n) = o(g(n)) and g(n) = o(h(n)) imply f(n)= o(g(n))f(n) = &#x3C9;(g(n)) and g(n) = &#x3C9;(h(n)) imply f(n)= &#x3C9;(g(n)) 01/08/13 22
• 23. Transpose symmetry f(n) =O(g(n)) iff g(n) = &#x3A9;(f(n)) f(n) =o(g(n)) iff g(n) = &#x3C9;(f(n))01/08/13 23
• 24. INSERTION SORT INSERTION SORT (A) Cost times 1 for j 2 to length [A] C1 n 2 do key A[j] C2 n-1 3 Insert A[j] into the sorted Sequence A [1 . . . j-1] 0 n-1 1 i j-1 C4 n-1 n 5 while i&gt;0 and A[i] &gt;key C5 tj j=201/08/13 24
• 25. n 6 do A[i+1] A[i] C6 (tj -1) j=2 n 7 i i+1 C7 (tj -1) j=2 8 A[i+1] key C8 n-101/08/13 25
• 26. Running time of insertion sort n nT(n) =c1n+c2(n-1) +c4(n-4)+c5 tj+c6 (tj-1) j=2 j=2 n +c7 (tj-1) +c8(n-1) j=201/08/13 26
• 27. Best caseIn insertion sort best case occurs if the array is already sorted then in line 5 when i has its initial value of j-1. thus tj =1 for all j=2,3,4&#x2026;..n and the best case running time isT(n)=c1(n) +c2(n-1)+c4(n-1)+c5(n-1) +c8(n-1) =(c1+c2+c4+c5+c8)n-(c2+c4+c5+c8) 01/08/13 27
• 28. This running time can be expressed as an+b for constant a and b that depend on the statement cost ci; It is thus a liner function of n.01/08/13 28
• 29. Worst case If the array is in reverse sorted order then we must compare each element A[j] with each element in the entire sorted sub array A[1&#x2026;j-1]and so tj=j for j=2,3,&#x2026;&#x2026;n n (tj-1) =n(n+1) -1 j=2 2 n (j-1)=n(n-1) J=2 201/08/13 29
• 30. T(n)=c1n+c2(n-1)+c4(n-1) +c5(n(n+1)/2-1)+c6(n(n-1)/2) + c7(n(n-1)/2)+c8(n-1) 2 =(c5/2+c6/2 c7/2)n + (c1+c2+c4+c5/2-c6/2-c7/2+c8)n -(c2+c4+c5+c8) This worst case running time can be 2 expressed as an+bn+c01/08/13 30
• 31. Worst case and average case The average case is often as bad as worst case . On average if half the element inA[1&#x2026;..j- 1]are less than A[j] and half are greater . On average we check half the sub array so tj=j/2. If we worked out the resulting average case running time it turn out to be a quadratic function of the input size ,just like the worst case running time.01/08/13 31
• 32. Example of insertion sort01/08/13 32
• 33. Order of growth we use some simplifying abstraction to ease our analysis of INSERTION SORT procedure . &#xF0A1; first we ignored the actual cost of each statement using the constant ci to represent these cost . &#xF0A1; We really need the worst case running 2 time is an+bn+c for some constant a , b, and c that depend upon the cost ci .01/08/13 33
• 34. We thus ignored not only the actual statement costs but also the abstract cost ci. &#xF0A1; We shall now make one more simplifying abstraction. &#xF0A1; It is rate of growth or order of growth. &#xF0A1; We therefore consider only leading term of a formula 2 (e.g. an ). &#xF0A1; We ignore the lower order terms and constant term because they are insignificant for large n. &#xF0A1; We also ignore constant coefficient of leading term . &#xF0A1; Thus we write that for example has a worst case 2 running tine of &#x398;(n).01/08/13 34
• 35. Designing Algorithms There are many ways to design algorithm , however here mainly we use two methods. Incremental approach : Insertion sort use incremental approach: having sorted the sub array A[1&#x2026;.j-1], we insert the single element A[j] into its proper place , yielding the sorted sub array A[1&#x2026;j] Divide and conquer approach: Many useful algorithms are recursive in structure .these algorithm typically follow a D and C approach . They break problem into several sub problem that are similar to original problem but smaller in size, solve the sub problem recursively and combine these solution to create a solution to original problem.01/08/13 35
• 36. Divide and conquer approach The divide and conquer paradigm involve three steps at each level of recursion: Divide: divide the problem into a number of sub problem . Conquer: conquer the sub problems by soloing them recursively. if the sub problem size is small enough ,however jus solve the sub problem in straightforward manner. Combine: combine the solution of the sub problems into the solution for original problem. the merge sort algorithm follow the divide and conquer paradigm.01/08/13 36
• 37. divide and conquer approach in merge sort Operation of merge sort on the array A=&lt;5,2,4,7,1,3,2,6&gt; Sorted sequence Initial sequence01/08/13 37
• 38. Analyzing divide and conquer algorithm &#xF0A1; When an algorithm contain a recursive call to itself its running can be described by a recurrence equation which describe the overall running time of a problem in term of running time of smaller inputs. &#xF0A1; We can use mathematical tool to solve recurrence equation and provide bounds on the performance of the algorithm.01/08/13 38
• 39. &#xF0A1; let T(n) be running time of on a problem of size n. &#xF0A1; If the problem size is small enough, say n &#x2264; c for some constant &#x2018;c&#x2019; the straightforward solution take constant time &#x398;(1). &#xF0A1; Let our division of problem yields &#x2018;a&#x2019; sub problem each of which is &#x2018;1/b&#x2019; of the original size, we get the recurrence . &#xF0A1; For merge sort both &#x2018;a&#x2019; and &#x2018;b&#x2019; are 2.01/08/13 39
• 40. &#xF0A1; If we take D(n) time to divide the problem into the solution and C(n) time to combine the solutions to the sub problems into solution to the original problem , we get the recurrences T(n)={&#x398;(1) if n &#x2264; c { aT(n/b) +D(n) +C(n) otherwise The method for solving recurrence are given in next slides.01/08/13 40