Hi, I have a task in Delphi. It shouldn't be a problem for those who are more advanced in Delphi: "Given a A(M,N) Matrix. Find the smallest element before the j-th column" If anyone can help. Thanks in advance
Which part gets you stuck? You'd be better to show us your working and answer and ask if you are right or not. or explain which bits trip you up just getting the answer won't make you a better programmer.
You know, I've been programming Pascal for some three decades now... and that question is gibberish. Sounds like the type of crap some teacher who isn't qualified to teach programming would come up with.
It's a square matrix, but the OP's question doesn't make much sense, really - the jth-column is just an arbitrary value for j = column number, so I don't really get the question at all. Maybe the OP can have a look at this paper, it explains the function fairly simple: http://pi.unl.edu/~scohn1/EngRevf08/matrix.pdf
You mean a two dimensional Array? Gah, I hate all this matrix asshattery. Reminds me of the dipshit 'matrix for 3d transforms' crap, where somehow 64 variables multiplied 4096 times is somehow magically supposed to be faster than 6 multiplies, one addition and one subtraction... I'd actually be interested to see the 'full' question, as I've got the feeling we're looking at a whale through a keyhole.
Take a look at the example I linked to. Yes, it's kind of a two dimensional array, but it's mainly a mathematical function, nothing to do with coding per se. It's a way to determine a set of values based on a grid-based logic, which can be mapped out in either a 2-dimensional or 3-dimensional visual presentation. I haven't dabbled too much with this myself, I just remember my ex doing a lot of these for her geophysics studies.