Sort an array according to the elements of another array

by

I’ll be surprised if anything is much faster than the obvious way:

a2.sort_by{|x| a1.index x.id}

More Related Contents:

  1. How to sort an array in Ruby to a particular order?
  2. how to i add objects to an array ? ruby
  3. How to sort in-place using the merge sort algorithm?
  4. Javascript Array.sort implementation?
  5. How do I pick randomly from an array?
  6. How to check if a value exists in an array in Ruby
  7. How to select unique elements
  8. Ruby array access 2 consecutive(chained) elements at a time
  9. How to find and return a duplicate value in array
  10. Array#each vs. Array#map
  11. Preserve key order (stable sort) when sorting with PHP’s uasort
  12. What does %w(array) mean?
  13. Group array by subarray values
  14. How to split (chunk) a Ruby array into parts of X elements? [duplicate]
  15. How to count duplicate elements in a Ruby array
  16. Find indices of elements that match a given condition
  17. Creating matrix with `Array.new(n, Array.new)`
  18. Sort hash by key, return hash in Ruby
  19. Find elements of array one nearest to elements of array two
  20. Create two-dimensional arrays and access sub-arrays in Ruby
  21. Is sort in Ruby stable?
  22. The intersection of two sorted arrays
  23. Performance of Arrays and Hashes in Ruby
  24. Ruby method Array#
  25. In Ruby, why does Array.new(size, object) create an array consisting of multiple references to the same object?
  26. Ruby – Difference between Array#
  27. How to sort an array of hashes in ruby
  28. How to count duplicates in Ruby Arrays
  29. Regarding in-place merge in an array
  30. Ruby: filter array by regex?

Leave a Comment