Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by pulp_57
1
answer
1
me test series
Given two unsorted singly-linked lists each with n distinct elements. There exists an efficient intersection algorithm, that computes and returns a new list with common elements between the input lists. How much time does the intersection algorithm requires in worst case, if it is allowed to ... only? answer is qiven as O(nlogn)...........i think it should be O(n^2)...please verify
Given two unsorted singly-linked lists each with n distinct elements. There exists an efficient intersection algorithm, that computes and returns a new list with common e...
968
views
commented
Feb 1, 2018
Algorithms
made-easy-test-series
time-complexity
sorting
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register