
Olel Arem
Followers: 0 Following: 0
Statistiques
0 Questions
4 Réponses
RANG
6 019
of 296 875
RÉPUTATION
8
CONTRIBUTIONS
0 Questions
4 Réponses
ACCEPTATION DE VOS RÉPONSES
0.00%
VOTES REÇUS
3
RANG
of 20 417
RÉPUTATION
N/A
CLASSEMENT MOYEN
0.00
CONTRIBUTIONS
0 Fichier
TÉLÉCHARGEMENTS
0
ALL TIME TÉLÉCHARGEMENTS
0
RANG
of 157 275
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
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 ...
presque 5 ans il y a | 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 ...
presque 5 ans il y a | 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...
presque 5 ans il y a | 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) ...
presque 5 ans il y a | 0