Skip to main content

Program 9: Bubble Sort

 **Program 9: Bubble Sort**


```assembly

.model small

.stack 100h


.data

    array db 5, 2, 8, 3, 1

    n db 5


.code

    main proc

        mov bx, n             ; Load 'n' into BX

        dec bx                ; Decrement BX for loop

        

    outer_loop:

        mov si, 0             ; Initialize SI for inner loop

        

    inner_loop:

        mov al, [array + si]  ; Load array element at index SI

        cmp al, [array + si + 1] ; Compare with next element

        jg swap_elements      ; Jump if greater (needs swapping)

        

        inc si                ; Increment SI for next element

        loop inner_loop       ; Decrement BX and loop if not zero

        

        loop outer_loop       ; Decrement BX and loop if not zero

        

        ; Print sorted array

        mov si, 0             ; Initialize SI for printing

        mov cx, n             ; Load 'n' into CX

        

    print_loop:

        mov dl, [array + si]  ; Load array element at index SI

        add dl, 30h           ; Convert to ASCII

        mov ah, 02h           ; DOS function to print character

        int 21h               ; Print character

        

        inc si                ; Increment SI for next element

        loop print_loop       ; Decrement CX and loop if not zero

        

        mov ah, 4Ch           ; Exit program

        int 21h

    main endp

end main

```


Explanation:

1. `.model small` and `.stack 100h`: Memory model and stack size definitions.

2. `.data` section: Declares the data segment.

   - `array db 5, 2, 8, 3, 1`: Defines a byte-sized array with values.

   - `n db 5`: Defines the length of the array.

3. `.code` section: Contains the main code.

   - `mov bx, n`: Move the value of "n" into BX.

   - `dec bx`: Decrement BX for the loop (BX = length - 1).

   - `outer_loop:`: Label for the outer loop.

   - `mov si, 0`: Initialize SI for the inner loop.

   - `inner_loop:`: Label for the inner loop.

   - `mov al, [array + si]`: Load the array element at index SI into AL.

   - `cmp al, [array + si + 1]`: Compare AL with the next element.

   - `jg swap_elements`: Jump to "swap_elements" if greater (needs swapping).

   - `inc si`: Increment SI for the next element.

   - `loop inner_loop`: Decrement BX and loop if not zero.

   - `loop outer_loop`: Decrement BX and loop if not zero.

   - `print_loop:`: Label for the loop to print the sorted array.

   - `mov dl, [array + si]`: Load the array element at index SI into DL.

   - `add dl, 30h`: Convert to ASCII.

   - `mov ah, 02h`: DOS function to print character.

   - `int 21h`: Print character.

   - `inc si`: Increment SI for the next element.

   - `loop print_loop`: Decrement CX and


 loop if not zero.

   - `mov ah, 4Ch`: Set the exit code for DOS.

   - `int 21h`: Call DOS interrupt to exit the program.


Comments

Popular posts from this blog

6. Generate a YACC specification to recognize a valid arithmetic expression that uses operators +, – , *,/ and parenthesis.

Below is a YACC specification for recognizing valid arithmetic expressions that involve operators (+, -, *, /) and parentheses. I'll explain each line of the code afterward: ```yacc %{ #include <stdio.h> %} %token NUMBER %left '+' '-' %left '*' '/' %% expression: expression '+' expression            | expression '-' expression            | expression '*' expression            | expression '/' expression            | '(' expression ')'            | NUMBER            ; %% int yylex() {     // Code for tokenizing input and returning tokens } void yyerror(const char *s) {     fprintf(stderr, "Error: %s\n", s); } int main() {     yyparse();     return 0; } ``` Now, let's break down the YACC specification line by line: 1. `%{` ... `%}`: This is the C code section where y...

1, Design and implement a lexical analyzer using C language to recognize all valid tokens in the input program. The lexical analyzer should ignore redundant spaces, tabs and newlines. It should also ignore comments

#include <stdio.h> #include <ctype.h> int main() {     char c;     while ((c = getchar()) != EOF) {         if (isspace(c)) {             // Ignore whitespace, tabs, and newlines             continue;         }         if (c == '/') {             // Check for comments             char nextChar = getchar();             if (nextChar == '/') {                 while ((nextChar = getchar()) != '\n');         ...

17. Write a program to perform constant propagation.

Sure, I can provide you with a basic example of a constant propagation program along with explanations for each line. Please note that this example is simplified and might not cover all possible cases of constant propagation. ```c #include <stdio.h> #include <stdbool.h> // Structure to represent an assignment statement struct Assignment {     char variable;     int value;     bool isConstant; }; int main() {     // Example assignments (variable, value, isConstant)     struct Assignment assignments[] = {         {'a', 10, true},         {'b', 20, true},         {'c', 0, true},         {'d', 30, false},         {'e', 0, false}     };     int numAssignments = sizeof(assignments) / sizeof(assignments[0]);     // Perform constant propagation     for (int i = 0; i < numAssignments; i++) { ...