Implementation Comparison
Need help with this assignment?Get an original answer from a qualified tutor — from $10/page.
Get it written →Class Project 2 – Implementation Comparison
Introduction:
- Our Class Project 1 had the goal of writing a report on a certain programming language of your choice, especially in regards to its paradigm(s), writability, readability, running and reasoning. Now the emphasis will be given to design, evaluation and implementation. You will be writing a program in a couple of languages.
- This project is individual, but collaboration is encouraged.
- In Class Project 1, you chose a programming language (except Java). You will need to use this same language to write a program for this project.
Tasks:
Task A – Implement 2 of the following popular algorithms using the language chosen in Class Project 1. (PYTHON)
Task B – Implement the same 2 algorithms you chose in another language of your choice (Java included). (ANY LANGUAGE)
ALGORITHMS:
- Quicksort
- Mergesort
- Egg Dropping
- Coin Change
- Longest Common Subsequence
- Longest Increasing Subsequence
- Heap Sort
- Breadth First Search
- Depth First Search
- Kruskal’s Algorithm
- Binary Search
- Prim’s Algorithm
- Bellman Ford Algorithm
- Dijkstra Algorithm
- Secure Hash Algorithm
- Integer Factorization
- Selection Sort
Task C – Once the 2 algorithms chosen are implemented in both languages, please write a maximum 1-page report comparing each implementation in regards to writability, readability, running and reasoning.
Get a plagiarism-free answer to this question
Send us your instructions and we’ll match you with the best writer in your subject.
- 100% human-written, zero AI
- Turnitin report included
- Confidential — we never share your data
- Free revisions & refunds