'Total time complexity' diaporamas de présentation

Planar Convex Hull

833 views • 51 slides

Computing Longest Common Substring/Subsequence of Non-linear Texts

Computing Longest Common Substring/Subsequence of Non-linear Texts . Kouji Shimohira , Shunsuke Inenaga , Hideo Bannai , Masayuki Takeda Kyushu University, Japan. Outline. Non-linear Text Computing Longest Common Subsequence of Acyclic Non-linear Texts

492 views • 34 slides

Randomized Algorithms

986 views • 33 slides

Convex Hull

Convex Hull. What is the Convex Hull?.

563 views • 15 slides

d026: Sunset Posters

d026: Sunset Posters. Po-Lung Chen Team Dont Block Me, National Taiwan University March 26, 2010. Problem Description (1/2). Given a skyline of houses on a street. We want to stick up some identical rectangular posters with width and height onto the wall.

322 views • 12 slides

Selection sort

Selection sort . Presentation Yixin Wang. The Algorithm. The big structure of selection sort is looping In each loop, usually we should do two steps. Find the smallest or biggest value in the list. Interchange the smallest or biggest value with the first or last element.

342 views • 9 slides