<Enter a one-sentence description of this project here.>
Project description
Sparkdata challenge for finding multiplicative pairs in a sorted array of decimal numbers that are constructed from two arrays (A,B), one containing the integer part and one containing the decimal part but as an integer.
The decimal numbers are then constructed as following: C[i] = A[i] + B[i] / scale
where the scale is a fixed number (here 1_000_000).
Free software: MIT license
Documentation: https://sparkdatachallenge.readthedocs.io.
Features
Brute force method that fails due to memory allocation for large arrays but only uses numpy vectorized functions
Brute force method based on a double for-loop
Math based method - optimized using mathematical properties of the inequalities and leveraging that the decimal number array C is sorted.
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Hashes for sparkdatachallenge-0.1.1-py3-none-any.whl
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | 6323433c0c5145e2c4048cb1fe3bfbaa6a8a3f7ac4066d8b8dcd4ceb38dd314a |
|
| MD5 | 1fea751e5b2ea927154ca645b42c5a51 |
|
| BLAKE2b-256 | fba44c334f75b1be84dfe6f5c911ee39fe60a117e995404b9a8f2b744640b9ba |
