السلام عليكم ورحمه الله وبركاته
لدي خوارزم من كتاب الداتى وهي كتالي
ممكن شرح النقاط خطوه خطوه اكون لكم من الشاكرين ارجوكم خطوه خطوه واسف على الازعاج اخواني
الخوارزم الاوووووول
- (insert into linare array ) insert (la,n,k,item)
- here la is linear array with n elements and K is apositive integer such that
- K<=J . this algorithm issert an element item int the K th position in la
- 1-[Initialize counter.] set j:=n.
- 2-Repcat steps 3 and 4 while j>=k.
- 3- [move j th element downward .] set la[j+1]:=la[j].
- 4- [decrease counter .] set j:=j-1.
- [end of step 2 loop.]
- 5-[insert element] set la[k]:=item.
- 6-[reset n ] set n:=n+1.
- 7-exit.
الخوارزم الثاااااااااني
- (deleting from a linear array ) delete (la , m,k,item)
- here la is linear array with n elements and K is apositive integer such that
- K<=J . this algorithm issert an element item int the K th position in la
- 1- set item := la[k].
- 2- repeat for j=k to n-1;
- [move j +1st element upward] set la[j]:=la[j+1].
- [end of loop]
- 3-[reset the number n of elements in la] set n:=n-1.
- 4-exit.
