Statistiques
0 Questions
4 Réponses
RANG
65 906
of 300 871
RÉPUTATION
0
CONTRIBUTIONS
0 Questions
4 Réponses
ACCEPTATION DE VOS RÉPONSES
0.00%
VOTES REÇUS
0
RANG
of 21 100
RÉPUTATION
N/A
CLASSEMENT MOYEN
0.00
CONTRIBUTIONS
0 Fichier
TÉLÉCHARGEMENTS
0
ALL TIME TÉLÉCHARGEMENTS
0
RANG
of 171 413
CONTRIBUTIONS
0 Problèmes
0 Solutions
SCORE
0
NOMBRE DE BADGES
0
CONTRIBUTIONS
0 Publications
CONTRIBUTIONS
0 Public Chaîne
CLASSEMENT MOYEN
CONTRIBUTIONS
0 Point fort
NOMBRE MOYEN DE LIKES
Feeds
Write a function called spiral_diag_sum that takes an odd positive integer n as an input and computes the sum of all the elements in the two diagonals of the n-by-n spiral matrix.
%if you dont want recursion & want to use loops instead, make use of below code function sum = spiral_diag_sum(n) if n == 1 ...
plus de 7 ans il y a | 0
Hi; Can you help me to find fault in my code?
function [u1,u2,u3] = sort3(v) if v(1) <= v(2) && v(2) <= v(3); u1=v(1);u2=v(2);u3=v(3); elseif ...
plus de 7 ans il y a | 0
Write a function called day_diff that takes four scalar positive integer inputs, month1, day1, month2, day2. These represents the birthdays of two children who were born in 2015. The function returns a positive integer scalar that is equal to the dif
if true function [ dd ] = day_diff( m1,d1,m2,d2 ) % Short circuiting! N = [31,28,31,30,31,30,31,31,30,31,30,31]; ...
plus de 7 ans il y a | 0
Is this working right
The question says to return them in 'non-decreasing' order. Your function is for decreasing order. function [u1,u2,u3] = sort3(...
plus de 7 ans il y a | 0
