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

  • Home
  • SEARCH
  • 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 8850405
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 14, 20262026-06-14T12:53:43+00:00 2026-06-14T12:53:43+00:00

Imagine you are implementing a List Data Type in C++. This List of yours

  • 0

Imagine you are implementing a List Data Type in C++. This List of yours will keep items in a simple array and will hold instances of type: “Animal”.

So for example, addItem method will be something like this:

void MyAnimalList::insertAnimal(Animal a){
    animalArray[currentPosition] = a;
    currentPosition++;
 }

So we simply have a currentPosition in the our List implementation and when we add a new Animal to it, Animal a is now referenced in the animalArray in “currentPosition” and currentPosition is then increased.

My question will be about retrieveItem. Is there any difference between these 2:

void MyAnimalList::getTheLastAddedAnimal(Animal &a){
    a = animalArray[currentPosition-1];
}

Animal MyAnimalList::getTheLastAddedAnimal(){
    return animalArray[currentPosition-1];
}

Obviously, the second method will be called like:

Animal lastAddedAnimal = myAnimalList.getTheLastAddedAnimal();

and the first one should be called like:

Animal someAnimal;
myAnimalList.getTheLastAddedAnimal(someAnimal);
  • 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-14T12:53:45+00:00Added an answer on June 14, 2026 at 12:53 pm

    The difference is semantic. If a method is called getXXXXX, you expect it to return that thing.

    Most decent compilers implement NRVO, so efficiency isn’t really an issue here. I’d go with the second version.

    I would however change the definition of insertAnimal(Animal a) to insertAnimal(const Animal& a).

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

Sidebar

Related Questions

Imagine two simple java applications. Both of them are implementing the same JAR file
This is similar to a recent question. I will be maintaining sorted a list
This question mentions that it is possible to go about implementing a linked list
imagine this html on a page <div id=hpl_content_wrap> <p class=foobar>this is one word and
Imagine I've got a database with lots of data, from which users can search.
Imagine a very big gwt project of application. This is just a some form
Imagine a functionality of an application that requires up to 5 threads crunching data,
I recently took a stab at implementing a concurrent priority queue using a skip-list
Imagine you have an application with several hundreds of classes implementing dozens of high
Implementing/handling idempotency in c# with Jolivers EventStore. Does this mean just taking care of

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.