Scribd Logo
Upload

Welcome to Scribd!

  • Unit - 1 - Algorithm

    Uploaded by

    Prof. Arpita Rajendra Ojha
    6 views1 page
    The document describes three algorithms: Traversal, Insert, and Delete. Traversal loops through each element of an array and applies a process. Insert shifts elements over and inserts a new item at a given position. Delete stores the item at a position, shifts elements down, and decrements the size.

    Original Description:

    Original Title

    Unit - 1_Algorithm

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes three algorithms: Traversal, Insert, and Delete. Traversal loops through each element of an array and applies a process. Insert shifts elements over and inserts a new item at a given position. Delete stores the item at a position, shifts elements down, and decrements the size.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    6 views1 page

    Unit - 1 - Algorithm

    Uploaded by

    Prof. Arpita Rajendra Ojha
    The document describes three algorithms: Traversal, Insert, and Delete. Traversal loops through each element of an array and applies a process. Insert shifts elements over and inserts a new item at a given position. Delete stores the item at a position, shifts elements down, and decrements the size.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Data Structure ( Unit – 1 )

    Traversal (A, LB, UB) A is an array with Lower Bound LB and Upper Bound UB.

    Step 1: for LOC = LB to UB do

    Step 2: Apply PROCESS to A [LOC]

    [End of for loop]

    Step 3: Exit

    Insert (A, N, ITEM, Pos) A is an array with N elements. ITEM is the element to be

    inserted in the position Pos.

    Step 1: for I = N-1 down to Pos

    A[ I + 1] = A[I]

    [End of for loop]

    Step 2: A [Pos] = ITEM

    Step 3: N = N+1

    Step 4: Exit

    Delete (A, N, ITEM, Pos) A is an array with N elements. ITEM is the element to be

    deleted in the position Pos and it is stored into variable Item.

    Step 1: ITEM = A [Pos]

    Step 2: for I = Pos down to N-1

    A[ I ] = A[I+1]

    [End of for loop]

    Step 3: N = N-1

    Step 4: Exit

    Prof. Arpita R. Ojha Page 1

    You might also like