![photo](/responsive_image/150/150/0/0/0/cache/matlabcentral/profiles/18315891_1588104956048_DEF.jpg)
Olel Arem
Followers: 0 Following: 0
Statistik
0 Fragen
4 Antworten
RANG
6.009
of 297.016
REPUTATION
8
BEITRÄGE
0 Fragen
4 Antworten
ANTWORTZUSTIMMUNG
0.00%
ERHALTENE STIMMEN
3
RANG
of 20.419
REPUTATION
N/A
DURCHSCHNITTLICHE BEWERTUNG
0.00
BEITRÄGE
0 Dateien
DOWNLOADS
0
ALL TIME DOWNLOADS
0
RANG
of 157.725
BEITRÄGE
0 Probleme
0 Lösungen
PUNKTESTAND
0
ANZAHL DER ABZEICHEN
0
BEITRÄGE
0 Beiträge
BEITRÄGE
0 Öffentlich Kanäle
DURCHSCHNITTLICHE BEWERTUNG
BEITRÄGE
0 Highlights
DURCHSCHNITTLICHE ANZAHL DER 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 ...
fast 5 Jahre vor | 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 ...
fast 5 Jahre vor | 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...
fast 5 Jahre vor | 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) ...
fast 5 Jahre vor | 0