Back to course home
0% completed
Vote For New Content
can someone please explain time complexity - inverse of Akermann func
sagarbpatil007
Dec 27, 2024
The amortized time complexity for find and union operations is order of the inverse of Akermann function (which in near constant) I am unsure how we came to this conclusion or calculated the time complexity. can someone please explain?
0
0
Comments
Comments
S
sagarbpatil007 10 months ago
I thought the time complexity (with use of compression and rank) was O(log n)
On this page