请用英特尔8086汇编语言实现对数组的排序

Sure, I can help you with that. Here's an example code for sorting an array in Intel 8086 assembly language:

; Sort an array of numbers in ascending order

DATA SEGMENT
    ARRAY DB 5, 2, 8, 1, 9, 3, 7, 4, 6  ; the array to be sorted
    ARRAY_SIZE DW 9                   ; the size of the array
DATA ENDS

CODE SEGMENT
ASSUME CS:CODE, DS:DATA

START:
    MOV AX, DATA      ; set up segments
    MOV DS, AX

    MOV CX, [ARRAY_SIZE]  ; loop counter
    DEC CX                ; CX = n-1

    OuterLoop:
        MOV BX, CX        ; BX = n-1
        InnerLoop:
            MOV SI, BX    ; SI = j
            DEC SI        ; SI = j-1

            MOV AL, [ARRAY+BX]   ; AL = A[j]
            MOV DL, [ARRAY+SI]   ; DL = A[j-1]
            CMP AL, DL           ; compare A[j] and A[j-1]
            JAE Continue        ; if A[j] >= A[j-1], continue

            ; swap A[j] and A[j-1]
            MOV [ARRAY+BX], DL
            MOV [ARRAY+SI], AL
            JMP InnerLoop

        Continue:
            DEC BX           ; j = j-1
            CMP BX, 0        ; if j = 0, break
            JNZ InnerLoop

    MOV AH, 4CH          ; exit program
    INT 21H
CODE ENDS

END START

In this code, we define an array of numbers to be sorted (`ARRAY`) and its size (`ARRAY_SIZE`). Then, we use two nested loops to compare and swap elements of the array until it is sorted in ascending order. The outer loop starts with `j = n-1` and the inner loop starts with `j-1`, and we compare `A[j]` and `A[j-1]` in each iteration. If `A[j] < A[j-1]`, we swap the two elements.

Note that this is just an example code and there are many other ways to implement sorting algorithms in assembly language. The Intel 8086 assembly language has a limited set of instructions and the code may not be optimized for performance or clarity.