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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 12, 20262026-06-12T07:39:19+00:00 2026-06-12T07:39:19+00:00

I was thinking of something like: // Runs algorithm() n times during an amount

  • 0

I was thinking of something like:

// Runs algorithm() n times during an amount of seconds.
void run(int seconds) {
  clock_t start = clock();
  clock_t current = start;
  while(double (current - start) / CLOCKS_PER_SEC <= seconds) {
    algorithm();
    current = clock();
  }   
}

I chose clock() over time() to avoid accounting time when the process sleeps.
I would like to know if there is a better way to achieve this, without using chrono.

  • 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-12T07:39:20+00:00Added an answer on June 12, 2026 at 7:39 am

    STLSoft has a performance_counter which works on UNIX and windows platforms. The library is header only and only requires a simple include:

    #include <platformstl/performance/performance_counter.hpp>
    
    void run(int seconds) {
      platformstl::performance_counter pc;
      platformstl::performance_counter::interval_type current = 0;
      pc.start();
      while ((current / 1000) <= seconds){
        algorithm();
        current += pc.stop_get_milliseconds_and_restart();
      }
    }
    

    You could also look at the source for hints on making your own.

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

Sidebar

Related Questions

Could mapreduce be used to implement a webserver? I'm thinking something like when a
Is it possible to define an object within another object? I'm thinking something like
I'm thinking of something like gnugo 's ascii interface. I'd think of the turns
So, I was thinking of doing something like this: zones#show /map/map_id/zones/zone_id And this: zones#index
I am actually thinking of something similar to the '*' operator in python like
Is there a way to efficiently compare two matrices, I was thinking something like
Preferably in .NET but I'm open to anything. I'm thinking of something where you
I have just done something without thinking it through. I have made a branch
Possible Duplicate: PHP take all combinations I'm thinking of making something in PHP that
I think I know C++ reasonably well and I am thinking about implementing something

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.