We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 72
Unit-1
Introduction and Elementary Data Structures
Algorithm Design and Analysis Process Algorithm Design and Analysis Process Algorithm Design Techniques/Strategies Properties of an algorithm Time Units to Compute ------------------------------------------------- - 1 for the assignment. - 1 assignment, n+ 1 test, and n increments. - n loops of 4 units for an assignment, an addition, and two multiplications. 1 for the return statement. -------------------------------------------- Formal Approach to Analysis Measures of Times Big-Theta Notation (Θ) Relational Properties of the Asymptotic Notations Review of elementary data structures Sequential Search Algorithm Binary Search Binary Search Analysis Insertion sort Analysis Of insertion sort SETS AND DISJOINT SET UNION Applications using Disjoint sets Hashing Handling collisions Open hashing Quadratic Hashing Chained hashing Example h(x)= sum of ASCII value %11