Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I have seen that declaring a bidimensional array as a jagged array is fine
int[][] jagged = new int[3][];
but when doing some optimization at memory level in code, it is more convenient to use [,] as a definition of a matrix and use blocks of memory…
so can you explain if this is true?
I guess the [,] takes a block of memory and the access of elements is faster rather than lookimg in several parts of memory in a jagged bidimensional array….
Yes, when an array is allocated as
[,], it is always given contiguous memory, so depending on what you want to do, it may be faster, convenient, etc