Answered: ogram in big-O notati

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

Analyze the time complexity of this program in big-O notation, assuming the size of L1 is n and the size of L2 is n too

public static <AnyType extends Comparable<? super AnyType>>
void intersection(List<AnyType> L1, List<AnyType> L2,
List<AnyType> Intersect)
{

ListIterator<AnyType> iterL1 = L1.listIterator();
ListIterator<AnyType> iterL2 = L2.listIterator();

AnyType itemL1=null, itemL2=null;

// get first item in each list
if ( iterL1.hasNext() && iterL2.hasNext() )
{
itemL1 = iterL1.next();
itemL2 = iterL2.next();
}

while ( itemL1 != null && itemL2 != null )
{
int compareResult = itemL1.compareTo(itemL2);

if ( compareResult == 0 )
{
Intersect.add(itemL1);
itemL1 = iterL1.hasNext()?iterL1.next():null;
itemL2 = iterL2.hasNext()?iterL2.next():null;
}
else if ( compareResult < 0 )
{
itemL1 = iterL1.hasNext()?iterL1.next():null;
}
else
{
itemL2 = iterL2.hasNext()?iterL2.next():null;
}
}

Expert Solution

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions