This preview shows pages 1–5. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: have a forloop implementation. • The inverse of Ackermann’s function is important to analyze Union/Find algorithm. 10/4/11 Dec 2, © UCF (Charles E. 44 Union/Find • Start with a collection S of unrelated elements – singleton equivalence classes • Union(x,y), x and y are in S, merges the class containing x ([x]) with that containing y ([y]) • Find(x) returns the canonical element of [x] • Can see if x& y, by seeing if Find(x)==Find(y) 10/4/11 Dec 2, © UCF (Charles E. 55 The “ Operator • Minimization: If G is already known to be recursive, then so is F, where F(x1,…,xn) = μ y (G(y,x1,…,xn) == 1) • We also allow other predicates besides testing for one. In fact any predicate that is recursive can be...
View
Full
Document
This note was uploaded on 10/03/2011 for the course COT 5310 taught by Professor Staff during the Spring '08 term at University of Central Florida.
 Spring '08
 Staff
 Algorithms

Click to edit the document details