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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 26, 20262026-05-26T23:53:16+00:00 2026-05-26T23:53:16+00:00

I cannot figure out how to prove an existence is true or not; static

  • 0

I cannot figure out how to prove an existence is true or not;

static boolean existsx(double p1x, double p2x,double[] varray) {
    boolean foundx = false;
    int i;
    //System.out.println(varray.length);

    for (double v : varray){
      if ( varray[i] > p1x &&  v < p2x) {
            foundx = true;
            //System.out.println(x+" was found to be between"+p1x+" and "+p2x);
            break;
       }
       else {
          foundx = false;
       }
    }
    return foundx;
} 

I’m trying to check for an existence of a number in an array between p1x and p2x. If it is true then, return true, else return false.

  • 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-26T23:53:16+00:00Added an answer on May 26, 2026 at 11:53 pm

    I think you have a few logical issues, declaring the variable i without ever initializing it being one of them.

    The following code should tell you if one of the numbers in the given array is in between those two:

    static boolean existsx(double p1x, double p2x,double[] varray){
        double upperBound = Math.max(p1x, p2x);
        double lowerBound = Math.min(p1x, p2x);
    
        for (double number : varray)
        {
           if ( (number <= upperBound) && (number >= lowerBound))
           {
               return true;
           }
        }
    
        return false;
    } 
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I cannot figure out how to get rid of errors that should not be
I cannot figure out why my array is not working, I have $carrier coming
I cannot figure out why this is not working. Can anyone explain to me
I cannot figure out why this Ajax request is not firing correctly. For simplicity's
I cannot figure out why the following function is not working. I will create
I cannot figure out why my model is not being populated. All the data
I cannot figure out why this is not working. I get the same thing
I cannot figure out, why the following code results in exception? static class Utility<T>
I cannot figure out how to change the title bar icon (the icon in
I cannot figure out a way to disable a container AND its children 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.