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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 18, 20262026-06-18T11:52:38+00:00 2026-06-18T11:52:38+00:00

I have written one recursive function and pointer to integer is passed as an

  • 0

I have written one recursive function and pointer to integer is passed as an argument. That integer value is incremented in function, but I am facing a strange issue that after some value its value never get updated. Even I am checking the value at that address.

Below is the code:–

   computeWait(long long int begin, long long int begin2, long long int w,
    int* current, int limit)      
   {    
      long long int next = 0, arrival = 0;

      long long int next1 = 0, service = 0;

      long long int serviceTime = 0;

      long long int wait = 0;

      static long long int Ta = 0;

      static long long int Ts = 0;
      static long long int W = 0;

      while(*current < limit)
      {
         next = (16807 * begin) % m;
         arrival = -200 * log((double)next/m);

         next1 = (16807 * begin2) % m;
         service = -100 * log(EDRN((double)next1));

         wait = max(0, (w + service - arrival));
         Ta = Ta + arrival; 
         Ts = Ts + service; 
         W = W + wait;

         *current = *current + 1;;
         computeWait(next, next1, wait, current, limit);
       }   

       printf("\n\nTotal arrival %Ld Total service %Ld Total wait %Ld\n", Ta/limit, Ts/limit, W/limit);
   }

   int main(int agrc, char* argv[])    
   {

       int num = 0;
       int currentValue = 0;        // seed number
       int end = 1000000;

       computeWait(1, 46831694, 0, &currentValue, end);          
   }

After 103917, its value doesnot get updated and it gives memory protection failure.

Please let me know where I am doing something wrong as it seems so trivial to fix it.

Thanks,
Neha.

  • 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-18T11:52:39+00:00Added an answer on June 18, 2026 at 11:52 am

    Well, I did not really try to understand the code, but I saw some big numbers and the word recursion.
    So I would guess its a stack overflow because your recursion is too deep?

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

Sidebar

Related Questions

I have written one custom paremeterized jquery function for fadein and fade out. That
I would like to write a recursive function in Python. I have written one
I have written the following function to search for a value in a binary
I have written a simple depth-first search in Scala with a recursive function like
I have written two recursive functions in python. The first one takes parameters, modifies
I have written one function in User Mapper class userExist($username) which return true if
I have a recursive function which can be written like: void func(TypeName *dataStructure, LL_Node
i have written one javascript function to retrieve the position of a button and
I have written one JavaScript function as follows: function CalcTotalAmt() { ---------- ----------- }
I have written one windows service that sends an email depending upon entries in

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.