You will need to find several problems. You will need to identify three instances of O(N2) notation. You will need to identify when it is using a Linked List for a stack. You will need to identify where it is using a sort and the type of sort it is. Where recursive method is broken and why it is broken. All the above must be without changing the existing code.
Hello,
I am a software engineer (Google) and I have been doing various projects using C++ and Java and I also rank amongst the top 100 coders from India.
Link - [login to view URL]
I assure you that I will be able to complete the project on time, with all the requirements fulfilled.
Hoping to work with you,
Thank You.
$25 USD en 1 día
5,0 (33 comentarios)
4,3
4,3
4 freelancers están ofertando un promedio de $21 USD por este trabajo
Hi,
I'm Abhijit and my background is in Computer Science . I am an expert Java developer and I have 5 years of experience coding with this language.
I have read the job description you provided above and it is about finding several problems in the code. I am very much familiar and interested to find the problems.
Also I'm a preferred freelancer in this site by virtue of Java coding skills. I also passed Java Level-1 exam in this site with very good results.
I will start from right then working on it as I am completely free to work in next 1 hour. I think it will be nice working for you.
i have a very knowledge in algorithms and data structures , i participated in many algorithmic competitions so i have a very good grasp of complexity theory