Feeds
已回答
Assignment question based on excel file I/O
function distance=get_distance(city_1,city_2) n=0;m=0; [value,name]=xlsread('Distances.xlsx'); for ii=1:size(name,2) if ...
Assignment question based on excel file I/O
function distance=get_distance(city_1,city_2) n=0;m=0; [value,name]=xlsread('Distances.xlsx'); for ii=1:size(name,2) if ...
5 years 前 | 2
已回答
Write a function called get_distance that accepts two character vector inputs representing the names of two cities. The function returns the distance between them as an output argument called distance. For example, the call get_distance('Seattle, WA'
function distance=get_distance(city_1,city_2) n=0;m=0; [value,name]=xlsread('Distances.xlsx'); for ii=1:size(name,2) if ...
Write a function called get_distance that accepts two character vector inputs representing the names of two cities. The function returns the distance between them as an output argument called distance. For example, the call get_distance('Seattle, WA'
function distance=get_distance(city_1,city_2) n=0;m=0; [value,name]=xlsread('Distances.xlsx'); for ii=1:size(name,2) if ...
5 years 前 | 1
已回答
Write a function called max_sum that takes v, a row vector of numbers, and n, a positive integer as inputs. The function needs to find the n consecutive elements of v whose sum is the largest possible.
function [summa,index]=max_sum(v,n) len_v=length(v);summa=0;poss=[];ii=1;jj=n; if n>len_v summa=0; index=-1; re...
Write a function called max_sum that takes v, a row vector of numbers, and n, a positive integer as inputs. The function needs to find the n consecutive elements of v whose sum is the largest possible.
function [summa,index]=max_sum(v,n) len_v=length(v);summa=0;poss=[];ii=1;jj=n; if n>len_v summa=0; index=-1; re...
5 years 前 | 0
已回答
caesar cyphor encryption problem .
Short code with use of Logical Indexing: function coded= caesar(string,shift) mod_str=string+shift; for i=1:length(mod_str) ...
caesar cyphor encryption problem .
Short code with use of Logical Indexing: function coded= caesar(string,shift) mod_str=string+shift; for i=1:length(mod_str) ...
5 years 前 | 0
