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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 18, 20262026-05-18T11:07:08+00:00 2026-05-18T11:07:08+00:00

So I hava an unsorted array of 30 ints like 340, 6401 1280, and

  • 0

So I hava an unsorted array of 30 ints like 340, 6401 1280, and so on random numbers. I have int x which was cined by user. I need to find which value in array is nearest down (lower, smaller,less) to that x value. How to do such thing?

  • 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-18T11:07:09+00:00Added an answer on May 18, 2026 at 11:07 am

    You could use std::max_element() with a custom comparison operator:

    struct limited_cmp {
       int limit;
       limited_cmp(int a_limit) : limit(a_limit) {
       }
       bool operator()(int left, int right) const {
          if (left <= limit && limit < right) {
             return false;
          }
          return (left < right);
       }
    };
    
    int main() {
       std::vector<int> numbers = ...;
       std::cout << "nearest is "
             << *std::max_element(numbers.begin(), numbers.end(), limited_cmp(5))
             << std::endl;   
    }
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I hava an activity which might have to load data when it's starting up.
I hava a thread in which I have an infinite loop, doing some network
I hava a project which will look like similar to Paint program. Here, I'm
I hava a problem which is described below. Do you have any good solution
I hava a binary file like this : offset | size/type | Description -------+-----------+-----------------------------------------------------------
i hava a c++ method(for java,jni) like follow,when i repeat call this from java
i hava two text boxs in flex.have to add two txt boxs values in
I hava an absolute url in my stylesheet. http://localhost/images/myimage.jpg . I also have a
I hava a main view, where you have one object and you can change
I hava a datalist in side that I have checkbox <asp:DataList ID=dlst1 runat=server RepeatDirection=Horizontal

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.