SophiaPretty

(5)

$14/per page/Negotiable

About SophiaPretty

Levels Tought:
Elementary,Middle School,High School,College,University,PHD

Expertise:
Accounting,Algebra See all
Accounting,Algebra,Applied Sciences,Architecture and Design,Art & Design,Biology,Business & Finance,Calculus,Chemistry,Communications,Computer Science,Economics,Engineering,English,Environmental science,Essay writing Hide all
Teaching Since: Jul 2017
Last Sign in: 213 Weeks Ago, 1 Day Ago
Questions Answered: 15833
Tutorials Posted: 15827

Education

  • MBA,PHD, Juris Doctor
    Strayer,Devery,Harvard University
    Mar-1995 - Mar-2002

Experience

  • Manager Planning
    WalMart
    Mar-2001 - Feb-2009

Category > Computer Science Posted 28 Nov 2017 My Price 7.00

What is the running time complexity of your method?

Problem #2:

Given two nonempty sorted lists, L1 and L2.

(a) a following method in Java that prints true if L2 ⊆ L1, and false otherwise. In

your implementation you can use only the basic list operators (next(), hasNext(), and

compareTo()).

Remember that L2 ⊆ L1 if for all x ∈ L2, x ∈ L1.

public static <AnyType extends Comparable<? super AnyType>>

 boolean subset(List<AnyType> L1, List<AnyType> L2)

{

 

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

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

 

 // get first item in each list

 if ( iterL1.hasNext() && iterL2.hasNext() )

 {

 itemL1 = iterL1.next();

 itemL2 = iterL2.next();

 }

 // YOUR CODE GOES HERE

}

(b) What is the running time complexity of your method?

Answers

SophiaPretty
(5)
Status NEW Posted 28 Nov 2017 07:11 AM My Price 7.00

-----------  ----------- H-----------ell-----------o S-----------ir/-----------Mad-----------am ----------- Th-----------ank----------- yo-----------u f-----------or -----------you-----------r i-----------nte-----------res-----------t a-----------nd -----------buy-----------ing----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n. -----------Ple-----------ase----------- pi-----------ng -----------me -----------on -----------cha-----------t I----------- am----------- on-----------lin-----------e o-----------r i-----------nbo-----------x m-----------e a----------- me-----------ssa-----------ge -----------I w-----------ill----------- be----------- qu-----------ick-----------ly

Not Rated(0)