solving data structure problem.

$10-30 CAD

Completato

Pubblicato

più di 6 anni fa

$10-30 CAD

Pagato al completamento

Give the Big-O performance of the following code fragment: for i in range(n): for j in range(n): k = 2 + 2 Give the Big-O performance of the following code fragment: for i in range(n): k = 2 + 2 Give the Big-O performance of the following code fragment: i = n while i > 0: k = 2 + 2 i = i // 2 Give the Big-O performance of the following code fragment: for i in range(n): for j in range(n): for k in range(n): k = 2 + 2 Give the Big-O performance of the following code fragment: i = n while i > 0: k = 2 + 2 i = i // 2 Give the Big-O performance of the following code fragment: for i in range(n): k = 2 + 2 for j in range(n): k = 2 + 2 for k in range(n): k = 2 + 2 Next Section - 2.11. Programming Exercises Mark as completed

Software Architecture

Rif. progetto: 16041381

Info sul progetto

18 proposte

Progetto a distanza

Attivo 6 anni fa

Hai voglia di guadagnare un po'?

Indirizzo Email

I vantaggi delle offerte su Freelancer

Imposta il tuo budget e le scadenze

Fatti pagare per il lavoro svolto

Delinea la tua proposta

La registrazione e le offerte sui lavori sono gratuite

Assegnato a:

@olga23407

A proposal has not yet been provided

$15 CAD in 1 giorno

4,9

(14 valutazioni)

2,9

18 freelance hanno fatto un'offerta media di $23 CAD

@it2051229

Hi there. I went through the requirements and I would like to do this project if given the opportunity. Let me know if you are interested so I can have further details.

$30 CAD in 1 giorno

4,9

(1564 valutazioni)

8,0

@hbxfnzwpf

50CAD for this project Relevant Skills and Experience I am very proficient in c and c++. I have 16 years c++ developing experience now, and have worked for more than 6 years. My work is online game developing, and mainly focus on client side. Proposed Milestones $50 CAD - Finish this project

$50 CAD in 1 giorno

4,8

(172 valutazioni)

7,1

@DucNA

I'm a senior software developer who have over 300 completed projects with 100% positive reviews and my account also is qualified by this site as a Preferred-freelancer Relevant Skills and Experience My portfolio: https://www.freelancer.com/u/DucNA.html Proposed Milestones $29 CAD - Milestone Could you please share me more details? Then I will check and let you know my estimation (time and effort) for this project.

$29 CAD in 0 giorno

4,9

(274 valutazioni)

6,6

@sajjadahmed19

A proposal has not yet been provided

$30 CAD in 2 giorni

4,9

(39 valutazioni)

5,4

@Bhawandtu

I have 5+ years of working experience in data structures and algorithms. Looking forward for a positive response from you. Relevant Skills and Experience Data structures, algorithms Proposed Milestones $15 CAD - Finish the task

$15 CAD in 1 giorno

4,9

(46 valutazioni)

4,7

@panjvirsingh

I would like to offer myself as a probable candidate for this assignment as I am confident of delivering a quality output. I have excellent expertise in this area. Relevant Skills and Experience I have total 7 years or experience in web development and design using java,j2ee,spring,hibernate,CSS,jquery,angular js, rest/soap web services Proposed Milestones $25 CAD - JAVA

$25 CAD in 1 giorno

4,8

(18 valutazioni)

4,0

@aknminc

Please send all your questions in doc or pdf format. We need formated code to estimate bigO correctly. Relevant Skills and Experience Java Level 1 (92%, 99th percentile). I have 17 years of tutoring expirience with homeworkhelp4u. We provide confidential programming help for students from USA, Canada, UK and other countries. Proposed Milestones $20 CAD - Full work

$20 CAD in 1 giorno

4,6

(9 valutazioni)

3,4

@gpsanjeewa

Hi, Easy works. Solution for first one is "constant time" Relevant Skills and Experience Currently following Msc in Computer Science Proposed Milestones $25 CAD - Completion Please send me the actual problem. Then I can complete the work quickly

$25 CAD in 0 giorno

4,8

(5 valutazioni)

2,8

@ManVu

Hi, I'm currently a software engineering student and has passed a data structure and algorithms course with 94%. I can definitely help you with your assignment. Just leave a message! Thanks Relevant Skills and Experience Data Structures and Algorithms Big O Notation Proposed Milestones $17 CAD - Solve the questions Additional Services Offered $2 CAD - Full explanation

$17 CAD in 1 giorno

4,7

(3 valutazioni)

2,2

@Ahmed1Zaky

I just have solved very similar examples and I already solved what's written in the description . Relevant Skills and Experience Data Structures, complexity analysis and Algorithms Proposed Milestones $20 CAD - Milestone

$20 CAD in 0 giorno

5,0

(1 valutazione)

1,8

@lindawalsh8989

can be done in less than an hour Relevant Skills and Experience knowledge of big o and running time of code Proposed Milestones $16 CAD - solutions

$16 CAD in 1 giorno

0,0

(0 valutazioni)

0,0

@SugyanSahu84

A proposal has not yet been provided

$14 CAD in 2 giorni

0,0

(0 valutazioni)

0,0

@sanya13105

A proposal has not yet been provided

$25 CAD in 2 giorni

0,0

(0 valutazioni)

0,0

@freelancer481

Hi. Having completed a Graduate Diploma in Computer Science I am well equipped to explain these questions Relevant Skills and Experience Graduate Diploma in Computer Science. Bachelor of Science in Theoretical Physics Proposed Milestones $15 CAD - Full completion I'm assuming that the questions did not display correctly - Is there missing square brackets for array access? Also the identation is important in python - for most of the questions it may change the answers As an example of my work: i = n while i > 0: k = 2 + 2 i = i // 2 The stuff inside the loop is of order O(1). (Slightly inaccurate with python due to supporting integers of unlimited size. Ignore this point unless it has come up in class before.) Therefore we need to find out a upper bound on the number of times the loop runs. Let m be such that m is the smallest integer such that 2^m >= n. Equivalently m is the number of times that 1 needs to be doubled to be greater than n. As such it provides a upper bound on the number of times n can be // 2 before reaching one. As the loop terminates on zero the answer is thus: O(m+1) >= O(log2(n)) = O(log(n)) as the change of basis of logs is a constant factor.

$15 CAD in 1 giorno