• Scheme

(define (reversed-inspect items)
  (foldl (lambda (x i)
          (display (format "~a ~a\n" i x))
          (sub1 i))
         (sub1 (length items))
        (reverse items)))

• C#

for(int i = items.Count - 1; i >= 0; i--)
{
    Console.WriteLine($"Index = {i}, Item = {items[i]}");
}

• Dart

var i = items.length ;
for (var e in items.reversed) {
  i--;
  print("$i, $e");
}

• Fortran

do i=size(items),1,-1
  print *,i,items(i)
end do

• Go

for i := len(items) - 1; i >= 0; i-- {
	x := items[i]
	fmt.Printf("Item %d = %v \n", i, x)
}

• JS

[...items].reverse().forEach((item, index) => 
console.log(Math.abs(index -= items.length), item));

• Java

reverse(items);
int i = items.size() - 1;
for (T x : items)
    out.printf("%s %s%n", i--, x);

• Java

ListIterator<X> g
    = items.reversed().listIterator();
X x;
int i, n = items.size() - 1;
while (g.hasNext()) {
    i = g.nextIndex();
    x = g.next();
    out.printf("%s %s%n", n - i, x);
}

• Java

int n = items.size();
iterate(n - 1, x -> x - 1)
    .limit(n)
    .forEach(i -> {
        out.println(i + " " + items.get(i));
    });

• Java

T x;
int i = items.size() - 1;
while (i != -1) {
    x = items.get(i);
    out.printf("%s %s%n", i--, x);
}

• Java

for(int i = items.length-1;i>=0;i--){
	System.out.println("Index:"+ i +", Value:" + items[i]); 
}

• Pascal

for i := items.count-1 downto 0 do writeln(i,' ',items[i]);

• Perl

for ($i = $#items; $i >= 0; $i--) {
    print "$i $items[$i]\n";
}

• Python

for i, x in enumerate(reversed(items)):
  print(f'{i} {x}')

• Python

for i in range(len(items)-1, -1, -1):
    print(i, items[i])

• Python

x = enumerate(items)
print(*reversed([*x]))

• Ruby

items.each_with_index.reverse_each{|x, i| puts "#{i} #{x}" }

• Rust

  for (i, x) in items.iter().rev().enumerate() {
    println!("{i} = {x}");
  }

• Rust

for (i, item) in items.iter().enumerate().rev() {
    println!("{} = {}", i, *item);
}