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];
Solution Stats
Problem Comments
2 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers21
Suggested Problems
-
Project Euler: Problem 9, Pythagorean numbers
1385 Solvers
-
Matrix with different incremental runs
131 Solvers
-
10271 Solvers
-
385 Solvers
-
488 Solvers
More from this Author7
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
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")