Statistics
0 Questions
4 Answers
RANK
122,302
of 298,993
REPUTATION
0
CONTRIBUTIONS
0 Questions
4 Answers
ANSWER ACCEPTANCE
0.00%
VOTES RECEIVED
0
RANK
of 20,661
REPUTATION
N/A
AVERAGE RATING
0.00
CONTRIBUTIONS
0 Files
DOWNLOADS
0
ALL TIME DOWNLOADS
0
RANK
of 163,029
CONTRIBUTIONS
0 Problems
0 Solutions
SCORE
0
NUMBER OF BADGES
0
CONTRIBUTIONS
0 Posts
CONTRIBUTIONS
0 Public Channels
AVERAGE RATING
CONTRIBUTIONS
0 Highlights
AVERAGE NO. OF 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 ...
7 years ago | 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 ...
7 years ago | 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]; ...
7 years ago | 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(...
7 years ago | 0
