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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 15, 20262026-05-15T19:16:52+00:00 2026-05-15T19:16:52+00:00

I have an array of 15000 elements each of which is an array of

  • 0

I have an array of 15000 elements each of which is an array of 4 elements. I want to sort by the second element of the 4. Originally I made the original array’s keys the second element and then k-sorted but unfortunately, some of the second elements are duplicates and since one key can’t refer to multiple elements i lost some elements in transition. I could bubble sort by the second element but I’m looking for something that runs at least on the order of nlog(n). Can anyone think of a good algorithm (or possibly a function in php that I don’t know about) that can sort by the second element? Thank you!

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

    I think you can use usort and define the cmp_function to use the second element.

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

Sidebar

Related Questions

I have an array of 1000-2000 elements which are pointers to objects. I want
I have an UInt16[1000,1000] array of 10-bit intensity values which I want shifted from
Let's say I have an array of zeros: a = numpy.zeros(1000) I then introduce
I want to have a large 2 dimensional array such like int myArray[10000][2]; I
I have array of strings, String[] data and it's 10 elements has value P
My problem: I have an JSON Array containing arrays, which i render into the
I have an array: int test[]={10212,10202,11000,11000,11010}; I want to split the inetger values to
For example I have an array with about 10 elements in it. std::deque<int> d;
I'm trying to compare all elements of an array to each other. I can
I have an array, and I want to make a hash so I can

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.