• C

unsigned i;
for (i = 0; i < sizeof(a) / sizeof(a[0]); ++i) {
	if (a[i] > x) {
		f();
		break;
	}
}

• C++

if (std::any_of(a.begin(), a.end(), [x](auto y) { return y > x; }))
    f();

• C#

if (a.Any(e => e > x))
    f();

• Dart

if (a.any((value) => value > x)) f();

• Fortran

if (any(a > x)) call f

• Go

for _, v := range a {
	if v > x {
		f()
		break
	}
}

• Groovy

if (a.any { it > x })
    f()

• Haskell

when (foldl1 (||) $ map (a > x)) f

• JS

if(a.some(item => item > x)){
	f()
}

• Java

for(int i = 0; i<a.length;i++) {
	if(a[i]>x) {
		f();
		break;
	}
}

• PHP

if (count(array_filter($a, function($v) { return $v > $x; })))
  f();

// or with intermediate steps
$tmp = array_filter(
  $a,
  function ($v) { return $v > $x; }
)
if (count($tmp))
  f();

// or with array reduce instead
if (
  array_reduce($a, 
    function($old, $item) { return $old or ($item > $x); }
  )
)
  f();

// Array reduce takes the old result $old, and 
// applies $item (from $a) to the old result 
// iteratively. We use the 'or' boolean operator
// to implement an 'any' operation.

• Pascal

for v in a do if v > x then f;

• Perl

f if any { $_ > $x } @a;

• Python

if any(v > x for v in a):
    f()

• Ruby

f if a.any?{|v| v > x }

• Rust

if a.iter().any(|&elem| elem > x) {
    f()
}

• Scheme

(let iter ((l a))
  (cond ((null? l) '())
        ((> (car l) x) (f))
        (else (iter (cdr l)))))