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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 23, 20262026-05-23T02:44:47+00:00 2026-05-23T02:44:47+00:00

int [] numbers = {1,2,3,4}; ReverseSortComparator c = new ReverseSortComparator(); Arrays.sort(c, numbers);

  • 0
int [] numbers = {1,2,3,4};
ReverseSortComparator c = new ReverseSortComparator();

Arrays.sort(c, numbers);
  • 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-23T02:44:48+00:00Added an answer on May 23, 2026 at 2:44 am

    There is no method in Arrays that takes a primitive array and a Comparator. You would have to have an Integer array, not an int array.

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

Sidebar

Related Questions

Consider the following array: int[,] numbers = new int[3, 2] { { 2, 1
function(int[] me) { //Whatever } main() { int[,] numbers = new int[3, 2] {
A basic solution would look like this: bool sortTest(int[] numbers, int target) { Array.Sort(numbers);
I have an array of positive/negative ints int[] numbers = new int[10]; numbers[0] =
I've got two arrays: char[] chars = { '1', '2', '3' }; int[] numbers
string newName = new name; int[] numbers = new int[] { 1, 2, 3
I have five arrays where I store incoming int numbers like: int array1 =
int[] numbers = { 5, 4, 1, 3, 9, 8, 6, 7, 2, 0
Let's say a program like this: class MyClass { public int Numbers; public char
I have queue from struct type struct test { int numbers; }; queue<test> q;

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.