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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 15, 20262026-06-15T08:59:54+00:00 2026-06-15T08:59:54+00:00

I know one is supposed to not mix and match new[] with delete and

  • 0

I know one is supposed to not mix and match new[] with delete and vice versa (delete[] with new). So

int* k = new int[5];
delete k;

is flawed as it will not free the allocated array. But is the following wrong?

int *k = new int[5];
for (int i = 0; i < 5; ++i)
    delete k[i];

by wrong I mean – will it actually cause a memory leak or undefined behavior?

EDIT** My bad, what I meant to type was this:

int** k = new int*[5];
memset(k, 0, sizeof(int*)*5);

k[3] = new int;

for (int i = 0; i < 5; ++i)
    if (k[i])
    {
        delete k[i];
        k[i] = 0;
    }

In the above, the block of 5 places is never actually freed unless i call delete[] on k itself, though I can new/delete manage the ints inside of it.

  • 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-15T08:59:55+00:00Added an answer on June 15, 2026 at 8:59 am

    k[i] is an int, so it’s syntactically invalid to call delete on it. The compiler should raise an error.

    Even if you could, it would result in undefined behavior (saying you have an array of pointers which you allocate with new[] and attempt to delete it with delete). Mixing new[] with delete and new[] with delete results in UB.

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

Sidebar

Related Questions

I know that detecting scrollbar presence is supposed to be one of those elusive
I know one awkward solution for this taks will be : first use ct
I know one is supposed to use a database sequence to obtain the value
I know you're not supposed to include slow-acting code on your UI thread in
I know this is not how you are supposed to do this but we
So I have this certain table. I know I'm not supposed to use table
Suppose that my index has 3 fields: title, x and y. I know one
I know one way to solve this question is to Hash the words and
I know one can add event listener for window.error. However when working with Iframes,
This is a very very basic question and I know one way is to

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.