Change math.Order order (#16356)

This speeds up algorithms like binary search

lib/std/math.zig

@@ -1482,15 +1482,15 @@ test "mulWide" {
 
 /// See also `CompareOperator`.
 pub const Order = enum {
+    /// Greater than (`>`)
+    gt,
+
     /// Less than (`<`)
     lt,
 
     /// Equal (`==`)
     eq,
 
-    /// Greater than (`>`)
-    gt,
-
     pub fn invert(self: Order) Order {
         return switch (self) {
             .lt => .gt,

test/cases/compile_errors/unhandled_enum_value_in_switch_with_enum_declared_in_other_file.zig

@@ -10,7 +10,7 @@ pub export fn entry1() void {
 // target=native
 //
 // :5:5: error: switch must handle all possibilities
+// :?:?: note: unhandled enumeration value: 'gt'
 // :?:?: note: unhandled enumeration value: 'lt'
 // :?:?: note: unhandled enumeration value: 'eq'
-// :?:?: note: unhandled enumeration value: 'gt'
 // :?:?: note: enum 'math.Order' declared here