Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 8843215
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 14, 20262026-06-14T11:09:56+00:00 2026-06-14T11:09:56+00:00

Is there a more robust way for the following problem: d = 1+(20-1).*rand(365,5); bthD

  • 0

Is there a more robust way for the following problem:

d = 1+(20-1).*rand(365,5);
bthD = 1:5;
I = repmat(bthD',73,1);

for i = 1:length(d);
    q(i) = d(i,I(i));
end  

Here, I are the indices that indicate which column of the matrix are required. q is the outcome where we have each row with the corresponding column number as specified by I. Is there an alternative way to find q?

modified question:

I have data:

d = 1+(20-1).*rand(365,5);

I would like to find the value in each row corresponding to the indices in I:

I = floor(1+(5-1).*rand(365,1));

This can easily be achieved by using a for loop:

for i = 1:length(d);
    q(i) = d(i,I(i));
end    

However, I would like to find an alternative way i.e. one that does not involve loops.

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-14T11:09:57+00:00Added an answer on June 14, 2026 at 11:09 am

    Use linear indexing:

    ii = 1:length(d);
    linear_index = sub2ind(size(d),ii,I(ii));
    q = d(linear_index);
    

    sub2ind converts row (ii) and column (I(ii)) indices to linear indices, which you can use to grab all the desired elements at once.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Is there more elegant (less code) way of find a matrix OUT, with colSums(OUT)<=a
Is there a more efficent way of doing this in terms of memory usage
Is there a more Ruby-ish and cleaner way to get a number to operate
Is there a more efficient way to list files from a bucket in Amazon
Is there any more efficient,cleaner and shorter form for following: if($x==null or $y==null or
Is there a more compact and/or conventional way to write this? With ActiveSheet.QueryTables.Add(Connection:=URL;http://carbon.brighterplanet.com/flights.txt, Destination:=Range(A2))
The Question: Is there a way that I can pass a JavaScript function into
Does anyone know if there is a way to convert the following string into
There are more than one solution for finding the-number-of-digits in a given number. For
There are more or less straightforward ways to emit or listen signals of existing

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.