# How should I write this algorithm?

hello I want to write this algorithm in sage, but I don't know how to write it as an algorithm in sage, could you please help me

Algorithm : update basis-update of intermediate basis G with reduct h Given: a finite set G_old ? B[X] and the reduct 0!=h ? B[X]

Find: updates G_new ? B[X] of G_old

begin

1: G_new <-- Ø

2: while G_old !=Ø do

3: selecting from G_old ; G_old <-- G_old {g}

4: if HT(h) not divisible HT(g) then

5: G_new <-- G_new U {g}

6: end

7:end

8: G_new <-- G_new U {h}

9: return G_new

end

thank you so much

edit retag close merge delete

Sort by » oldest newest most voted

Some of the code you wrote didn't make it. You should indent code so that it is displayed properly.

I don't exactly understand your algorithm, but from what I can grasp it might be something like this.

def update_basis(G,h):
G_old = G.copy()
G_new = []
while G_old:
g = G_old.pop()
if ht(h) % ht(g):
G_new.append(g)
G_new.append(h)
return G_new

more

thank you so so much, I think I should learn python programming ..

( 2013-04-15 06:37:59 -0600 )edit