How to find the largest entry in a matrix using loops
start with:
import numpy as np
A = np.asarray([[2, 0, -6, 0]
[-4, 5, -4, 7]
[1, 3, 7, 2]
[0, 8, 1, 6]])
determine the total number of negative entries in the matrix, the largest of them (magnitude) and it's location. Print the above information (for example the display should show that there are 3 negative entries, with the largest negative value equal to -6, located at (1,3).) Use loops, not min and max functions.
python-3.x
asked Nov 20 '18 at 0:31
kjfaksdjfkjfaksdjf
61
add a comment |
start with:
import numpy as np
A = np.asarray([[2, 0, -6, 0]
[-4, 5, -4, 7]
[1, 3, 7, 2]
[0, 8, 1, 6]])
determine the total number of negative entries in the matrix, the largest of them (magnitude) and it's location. Print the above information (for example the display should show that there are 3 negative entries, with the largest negative value equal to -6, located at (1,3).) Use loops, not min and max functions.
python-3.x
asked Nov 20 '18 at 0:31
kjfaksdjfkjfaksdjf
61
add a comment |
start with:
import numpy as np
A = np.asarray([[2, 0, -6, 0]
[-4, 5, -4, 7]
[1, 3, 7, 2]
[0, 8, 1, 6]])
determine the total number of negative entries in the matrix, the largest of them (magnitude) and it's location. Print the above information (for example the display should show that there are 3 negative entries, with the largest negative value equal to -6, located at (1,3).) Use loops, not min and max functions.
python-3.x
asked Nov 20 '18 at 0:31
kjfaksdjfkjfaksdjf
61
start with:
import numpy as np
A = np.asarray([[2, 0, -6, 0]
[-4, 5, -4, 7]
[1, 3, 7, 2]
[0, 8, 1, 6]])
determine the total number of negative entries in the matrix, the largest of them (magnitude) and it's location. Print the above information (for example the display should show that there are 3 negative entries, with the largest negative value equal to -6, located at (1,3).) Use loops, not min and max functions.
python-3.x
python-3.x
asked Nov 20 '18 at 0:31
kjfaksdjfkjfaksdjf
61
asked Nov 20 '18 at 0:31
kjfaksdjfkjfaksdjf
61
asked Nov 20 '18 at 0:31
kjfaksdjfkjfaksdjf
61
asked Nov 20 '18 at 0:31
kjfaksdjfkjfaksdjf
61
asked Nov 20 '18 at 0:31
kjfaksdjfkjfaksdjf
61
61
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53384565%2fhow-to-find-the-largest-entry-in-a-matrix-using-loops%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53384565%2fhow-to-find-the-largest-entry-in-a-matrix-using-loops%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
