Given an input element x, and the dimensions, (m, n) return a matrix of size m x n filled with element x. This must be done in less than half the time that repmat(x, m, n) takes. This is the sequel to http://www.mathworks.com/matlabcentral/cody/problems/1237-it-s-race-time-write-a-faster-function-than-the-test-suite-call-of-unique.
Example: Input: repl_mat(2, 2, 5) Output: [2, 2, 2, 2, 2; 2, 2, 2, 2, 2];
This doesn't seem to be possible anymore: http://stackoverflow.com/questions/28722723/matlab-bsxfun-no-longer-faster-than-repmat. Any chance of updating the problem with looser time tolerances?
This problem is meanless!
The solutions passed are not always fast than repmat, or just cheat(ex. using "tic")
Find state names that end with the letter A
507 Solvers
It dseon't mettar waht oedrr the lrettes in a wrod are.
465 Solvers
76 Solvers
Rotate input square matrix 90 degrees CCW without rot90
250 Solvers
168 Solvers