Skip to content

Latest commit

 

History

History
23 lines (14 loc) · 546 Bytes

Readme.md

File metadata and controls

23 lines (14 loc) · 546 Bytes

Old-fashioned multiplication.

The search of this report is to make an analysis on the data gathered in tests of how long does it take for a computer to do different multiplication versions by a certain number of times, always with the same random numbers.

Prerequisites

  1. gcc
  2. nasm

Running

To start it is necessary to open a new window in the operating system finalization and write:

  • make
  • ./a.out

Authors

  • José Ceciliano Granados

  • Luis Alejando Garita

    License

This project is licensed under the MIT License