HW1 - p.86 3.12 a. Write a nonrecursive procedure to...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Sheet1 Page 1 p.85 3.6 Write a function to add two polynomials. Do not destroy the input. Use a linked list implementation. If the polynomials have M and N terms, respectively, what is the time complexity of your program?
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: p.86 3.12 a. Write a nonrecursive procedure to reverse a singly linked list in O(N) time. *b. Write a procedure to reverse a singly linked list in O(N) time using constant extra space....
View Full Document

Ask a homework question - tutors are online