Be concise.
Be useful.
All contributions dictatorially edited by webmasters to match personal tastes.
Please do not paste any copyright violating material.
Please try to avoid dependencies to third-party libraries and frameworks.
int *p1 = x;
int *p2 = x + N-1;
while (p1 < p2)
{
int temp = *p1;
*(p1++) = *p2;
*(p2--) = temp;
}List.rev x(reverse x)x = x.reversed.toList();x = Enum.reverse(x)lists:reverse(List) a = a(ubound(a,dim=1)::-1)for i, j := 0, len(x)-1; i < j; i, j = i+1, j-1 {
x[i], x[j] = x[j], x[i]
}func reverse[T any](x []T) {
for i, j := 0, len(x)-1; i < j; i, j = i+1, j-1 {
x[i], x[j] = x[j], x[i]
}
}x = x.reverse()reverse x
x = x.reverse();val reversedView = x.asReversed()x.reverse()x = x.reversed()(reverse x)function array_reverse(x)
local n, m = #x, #x/2
for i=1, m do
x[i], x[n-i+1] = x[n-i+1], x[i]
end
return x
end
rev = {}
for i=#x, 1, -1 do
rev[#rev+1] = x[i]
end
-- in-situ reversal
function reverse(t)
local n = #t
local i = 1
for i = 1, n do
t[i],t[n] = t[n],t[i]
n = n - 1
end
endrev = {}
for i=#x, 1, -1 do
rev[#rev+1] = x[i]
end
x = rev$x = array_reverse($x, true);var n,i: integer;
[...]
n:= length(x);
setlength(x, n+1);
for i := 0 to (n div 2)-1 do
begin
x[n] := x[i];
x[i] := x[n-i-1];
x[n-i-1] := x[n];
end;
setlength(x, n);var n,i: integer;
tmp:TElement;
[...]
n:= length(x);
for i := 0 to (n div 2)-1 do
begin
tmp := x[i];
x[i] := x[n-i-1];
x[n-i-1] := tmp;
end;my @list = ('words', 'of', 'list', 'a', 'reverse');
my @reversed = reverse @list;reverse(x, Reversed).x.reverse()y = x[::-1]length = len(x) - 1
for a in range(length // 2 + 1):
b = length - a
x[a], x[b] = x[b], x[a]x = reversed(x)x.reverse!x.reverse();let y: Vec<_> = x.into_iter().rev().collect();x = x.reverse(reverse x)555555555Dim ItemList As New List(Of String)(New String() {"one", "two", "three"})
ItemList.Reverse()
For Each item In ItemList
Console.WriteLine(item)
Next