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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 13, 20262026-06-13T04:12:23+00:00 2026-06-13T04:12:23+00:00

I am trying to find an efficient way to compare a given array that

  • 0

I am trying to find an efficient way to compare a given array that represents the Quality of Service of a Client with the QOS of a Two Web Services and pick up the most similar to the given QOS.

  int[] arrayCompare(int[] clientQOS){

      int[] service1QOS=new int[]{3,1,4};
      int[] service2QOS=new int[]{1,3,3};

      //I want to compare clientQOS     with  S1 QOS       and S2 QOS

      return  mostSimilarArray
   }
  • 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-13T04:12:25+00:00Added an answer on June 13, 2026 at 4:12 am

    Loop through the source array for each target, incrementing a counter by the delta (positive difference between the values). The smallest delta sum is the closest match.

    Caveats

    This should be true if you consider numerically closer to be more similar, and the scale between different values are equal.

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

Sidebar

Related Questions

I am trying to find an efficient way to sort an array of strings
I am trying to find an efficient way of parsing files that holds fixed
I'm trying to find a very efficient way to encrypt files. One way that
I am trying to find an efficient way of ordering a array by a
I am trying to find the most efficient, optimized and fastest way to compare
I'm trying to find the best (efficient) way of doing this. I have a
I'm trying to find a reasonably efficient way of getting any single integer not
Trying to find an efficient way to extract all instances of items in an
I'm trying to find an efficient way to find the rank of an object
I'm trying to find the most efficient way to determine if a table row

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.