Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/crutchtheclutch/cmsc-451-projects
This repo contains both Project-1 and Project-2 from CMSC-451 as they are both closely related.
https://github.com/crutchtheclutch/cmsc-451-projects
Last synced: about 1 month ago
JSON representation
This repo contains both Project-1 and Project-2 from CMSC-451 as they are both closely related.
- Host: GitHub
- URL: https://github.com/crutchtheclutch/cmsc-451-projects
- Owner: CrutchTheClutch
- Created: 2018-10-12T01:07:41.000Z (about 6 years ago)
- Default Branch: master
- Last Pushed: 2019-02-01T07:28:43.000Z (almost 6 years ago)
- Last Synced: 2024-10-23T12:04:41.985Z (3 months ago)
- Language: Java
- Size: 1010 KB
- Stars: 1
- Watchers: 1
- Forks: 2
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# CMSC-451-Projects
#### This repo contains both Project-1 and Project-2 from CMSC-451 as they are both closely related.In Project 1, I have created a program that benchmarks the behavior of the Java implementations of the insertion sort algorithm. This program then outputs the performance of both iterative and recursive versions of insertion sort. You can find the rubric for Project 1 in the Rubrics folder, titled Project 1 Rubric.
In Project 2, I have written up the analysis of the results that I have obtained in first project. This writup covers the pseudocode, the Big-Θ analysis, the differences in performance, and more. You can find the rubric for Project 2 in the Rubrics folder, titled Project 2 Rubric.
---
###### This project was assigned while attending University of Maryland University College (UMUC)
--->
Design and Analysis of Computer Algorithms
>CMSC 451
>A presentation of fundamental techniques for designing and analyzing computer algorithms. The aim is to apply Big-O estimates of algorithms and proof-of-correctness techniques and to design algorithms. Basic methods include divide-and-conquer techniques, search and traversal techniques, dynamic programming, greedy methods, and induction. Programming projects are included.