4

我有一个包含日期的数组。

dates = [#<DateTime: 2002-07-01T00:00:00+00:00 ((2452457j,0s,0n),+0s,2299161j)>, #<DateTime: 2003-10-31T00:00:00+00:00 ((2452944j,0s,0n),+0s,2299161j)>, #<DateTime: 2003-12-01T00:00:00+00:00 ((2452975j,0s,0n),+0s,2299161j)>, #<DateTime: 2004-03-01T00:00:00+00:00 ((2453066j,0s,0n),+0s,2299161j)>, #<DateTime: 2004-03-01T00:00:00+00:00 ((2453066j,0s,0n),+0s,2299161j)>]

如果它是升序还是降序,我如何检查这个数组的排序顺序?

4

4 回答 4

11

如果每两个相邻元素中的第一个小于或等于第二个,则数组是升序的:

def ascending? arr
  arr.each_cons(2).all?{|left, right| left <= right}
end

或者(更漂亮但不幸的是更慢),您可以将数组与自身的排序版本进行比较:

def ascending? arr
  arr == arr.sort
end
于 2012-10-15T16:54:42.267 回答
6

以下是处理速度的一些基准测试结果:

require 'benchmark'
require 'date'

ary = (DateTime.parse('2002-07-01T00:00:00+00:00') .. DateTime.parse('2004-03-01T00:00:00+00:00')).to_a

def ascending1? arr
  arr.reduce{ |e1,e2| e1 <= e2 ? e2 : (return false) }; true
end

def ascending2? arr
  arr.each_cons(2).all?{|i,j| i <= j}
end

def ascending3? arr
  arr == arr.sort
end

n = 10_000
Benchmark.bm(9) do |b|
  b.report('reduce')    { n.times{ ascending1?(ary) } }
  b.report('each_cons') { n.times{ ascending2?(ary) } }
  b.report('sort')      { n.times{ ascending3?(ary) } }
end

随着测试结果:

                user     system      total        real
reduce      1.380000   0.000000   1.380000 (  1.381107)
each_cons   2.250000   0.000000   2.250000 (  2.243958)
sort        0.670000   0.000000   0.670000 (  0.675025)

以下是 2020 年的一些结果ruby 2.7.1p83 (2020-03-31 revision a0c7c23c9c) [x86_64-darwin19]

                user     system      total        real
reduce      0.765766   0.000939   0.766705 (  0.767853)
each_cons   1.220724   0.001394   1.222118 (  1.223502)
sort        0.693166   0.009011   0.702177 (  0.702492)
于 2012-10-15T18:33:04.440 回答
4

为什么不检查排序后的数组是否与未排序的数组相同?

array == array.sort用于上升

array == array.sort.reverse下降

于 2015-09-24T00:08:02.483 回答
0

我认为reduce会比each_cons

def ascending? arr
  arr.reduce{ |e1,e2| e1 <= e2 ? e2 : (return false) }; true
end
于 2012-10-15T17:10:15.553 回答