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 6977167
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 27, 20262026-05-27T17:35:28+00:00 2026-05-27T17:35:28+00:00

Because of my algorithm i have to insert some empty(NULL) nodes into my vector,some

  • 0

Because of my algorithm i have to insert some empty(NULL) nodes into my vector,some gaps i mean.How can i perform this?

I had tried like

array.push_back(NULL);

But it adds nodes with 0 value.

Edit:

I get values from integer array like int a[10000] and insert them into vector sirali_dizi with leaving some gaps into my vector.So i want to leave some gaps but with this every round i want to sort my array also.So i can’t use -1 or 0 etc.

  • 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-05-27T17:35:28+00:00Added an answer on May 27, 2026 at 5:35 pm

    You could make a vector of pointers to int instead of int:

    vector<int*> vInt;
    vInt.push_back(NULL);
    

    And then access the values this way:

    vector<int*>::iterator iIter;
    for(iIter = vInt.begin(); iIter != vInt.end(); iIter++){
        if(*iIter != NULL){
            // Notice the double asterisk: it's a pointer (the iterator) to another pointer (the value)
            cout << **iIter << endl;
        }
    }
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I know that Floyd–Steinberg dithering algorithm can't be implemented with pixel shader, because that
I have an complex algorithm which uses really deep recursion. Because there is stack
I need some advice when it comes to solving a sorting algorithm. This particular
I am buliding a GUI around an algorithm. For this purpose I have a
I have some contacts autocomplete and autosearch algorithm working for my android app. First
Most of the time, STL iterators are CopyConstructable, because several STL algorithms require this
Because Canvas3D doesn't have the ability to resize dynamically with the parent frame, I
Because I've made .cpp files and then transferred them into .h files, the only
Page 120 of Programming Pearls 1st edition presents this algorithm for selecting M equally
Situation looks like this: We have product 'A123' and we have to remember lowest

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.