Skip to content

My implementation of a maximum pairwise product algorithm in C++11

Notifications You must be signed in to change notification settings

HisashiQ/maxPairwiseProductAlgorithm

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 

Repository files navigation

maxPairwiseProductAlgorithm

  • To compile, run g++ -std=c++11 -O3 main.cpp -o pairwise
  • To run: ./pairwise
  • Enter in the size of the list/array
  • Enter in the numbers to fill the array
  • For example this might look like:

4

12 10000 5000 30

  • Output would be:

1 : 10000/2 : 5000 (Index position in array : number)

50000000 (Product of 10000 and 5000)

To stress test, comment out parts of the code as explained in main.cpp and recomplie

About

My implementation of a maximum pairwise product algorithm in C++11

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages