Explore >> Select a destination
|
You are here 
|
cliffle.com | ||
| | | | |
www.evanmiller.org
|
|
| | | | | A review of Rust, the programming language built for safety - not necessarily for comfort. | |
| | | | |
www.nayuki.io
|
|
| | | | | ||
| | | | |
www.moddable.com
|
|
| | | | | Presentation to TC39, the JavaScript language committee, to introduce XS, the JavaScript engine by Moddable Tech. Background on the XS engine and technical details on techniques used to minimize memory and code size, while maintaining near full conformance. | |
| | | | |
www.jeremykun.com
|
|
| | | Problem: Compute the product of two polynomials efficiently. Solution: import numpy from numpy.fft import fft, ifft def poly_mul(p1, p2): """Multiply two polynomials. p1 and p2 are arrays of coefficients in degree-increasing order. """ deg1 = p1.shape[0] - 1 deg2 = p1.shape[0] - 1 # Would be 2*(deg1 + deg2) + 1, but the next-power-of-2 handles the +1 total_num_pts = 2 * (deg1 + deg2) next_power_of_2 = 1 << (total_num_pts - 1). | ||
