Pseudo Code for Array-Based List Implementation in C

This document outlines the pseudo code demonstrating an array-based implementation of a list in C. The implementation will support basic operations: inserting an element, deleting an element, and displaying the list using a switch-case structure.

Key Components

1. Data Structure

   • Define an array to store list elements.
   • Maintain a variable to track the current number of elements in the list.

2. Functions

   • Insert an element
   • Delete an element
   • Display the list

3. Menu-driven Interface

   • Use a loop to present options to the user.
   • Use switch-case for handling user inputs.

Pseudo Code

BEGIN

    // Constants
    DEFINE MAX_SIZE AS 100

    // Global Variables
    DECLARE list[MAX_SIZE] AS INTEGER
    DECLARE count AS INTEGER INITIALIZE TO 0

    FUNCTION insertElement(element)
        IF count < MAX_SIZE THEN
            list[count] = element
            count = count + 1
            PRINT "Element inserted successfully."
        ELSE
            PRINT "List is full. Cannot insert element."
        END IF
    END FUNCTION

    FUNCTION deleteElement(element)
        DECLARE found AS BOOLEAN INITIALIZE TO FALSE

        FOR i FROM 0 TO count - 1 DO
            IF list[i] == element THEN
                found = TRUE
                // Shift elements to the left
                FOR j FROM i TO count - 2 DO
                    list[j] = list[j + 1]
                END FOR
                count = count - 1
                PRINT "Element deleted successfully."
                BREAK
            END IF
        END FOR

        IF NOT found THEN
            PRINT "Element not found."
        END IF
    END FUNCTION

    FUNCTION displayList()
        IF count == 0 THEN
            PRINT "List is empty."
        ELSE
            PRINT "List elements:"
            FOR i FROM 0 TO count - 1 DO
                PRINT list[i]
            END FOR
        END IF
    END FUNCTION

    FUNCTION main()
        DECLARE choice AS INTEGER
        DECLARE element AS INTEGER

        REPEAT
            PRINT "Menu:"
            PRINT "1. Insert Element"
            PRINT "2. Delete Element"
            PRINT "3. Display List"
            PRINT "4. Exit"
            PRINT "Enter your choice:"
            READ choice

            SWITCH choice DO
                CASE 1:
                    PRINT "Enter element to insert:"
                    READ element
                    CALL insertElement(element)
                    BREAK

                CASE 2:
                    PRINT "Enter element to delete:"
                    READ element
                    CALL deleteElement(element)
                    BREAK

                CASE 3:
                    CALL displayList()
                    BREAK

                CASE 4:
                    PRINT "Exiting the program."
                    BREAK

                DEFAULT:
                    PRINT "Invalid choice. Please try again."
            END SWITCH
        UNTIL choice == 4
    END FUNCTION

    // Start the program
    CALL main()

END

Explanation of Functions

• insertElement: Checks if the list has space, inserts an element, and updates the count.
• deleteElement: Searches for the element, shifts the remaining elements, and decrements the count if found.
• displayList: Prints the current elements in the list.

Conclusion

This pseudo code serves as a foundational blueprint for developing a C program that operates with an array-based list. The modular approach ensures clarity, simplicity, and maintainability during the implementation phase. For those looking to enhance their skills in data structures and programming, consider exploring the Enterprise DNA Platform for further resources and courses.