Routh-Hurwitz Stability Criterion

[FlatAssembler]

What do you think, what is the easiest way to implement the special cases of the Hurwitz algorithm, that is, when one or more elements in a row of the matrix are zero?
The core of my program implementing the Hurwitz Algorithm is this (in AEC, the programming language I designed and implemented):

Code:

Function popuni_matricu() Which Returns Integer16 Does
  Integer16 broj_stupaca :=
              (stupanj_polinoma + 1) / 2 + mod(stupanj_polinoma + 1, 2),
            broj_redaka := stupanj_polinoma + 1;
  Integer16 i := 0;
  //Popunimo matricu prvo not-a-numbersima...
  While i < broj_redaka Loop
    Integer16 j := 0;
    While j < broj_stupaca Loop
      matrica[f(i, j)] := 0. / 0.;
      j += 1;
    EndWhile
    i += 1;
  EndWhile
  //Zatim idemo primjeniti Hurwitzov algoritam...
  i := 0;
  While i < broj_redaka Loop
    Integer16 j := 0;
    While j < broj_stupaca Loop
      If i = 0 Then // Prvi redak
        matrica[f(i, j)] := polinom[j * 2];
      ElseIf i = 1 Then // Drugi redak
        matrica[f(i, j)] := (j * 2 + 1 < stupanj_polinoma + 1) ?
                            polinom[j * 2 + 1] :
                            0;
      Else // Ostali reci...
        If matrica[f(i - 1, 0)] = 0 Then
          //TODO: Implementirati što se radi u posebnim slučajevima...
          Return 0;
        EndIf
        matrica[f(i, j)] := (matrica[f(i - 1, 0)] *
                            (j + 1 < broj_stupaca ?
                             matrica[f(i - 2, j + 1)] : 0) -
                            (matrica[f(i - 2, 0)] *
                            (j + 1 < broj_stupaca ?
                             matrica[f(i - 1, j + 1)] : 0))) /
                            matrica[f(i - 1 , 0)];
      EndIf
      j += 1;
    EndWhile
    i += 1;
  EndWhile
  If matrica[f(broj_redaka - 1, 0)] = polinom[stupanj_polinoma] Then
    Return 1;
  EndIf
  Return 0;
EndFunction

What should be done at the place of TODO, instead of returning an error code? Neso Academy video presents two ways of dealing with that, none of which seem easy to program.

[BrianSoddingBoru4]

I don’t know.

Boru

[The Valkyrie]

Try T0T0 instead.

It's in Kansas.

Or Africa.

Just watch out for the rains.

[FlatAssembler]

I don’t know.

Boru

I think the Osnove Automatskog Upravljanja (where we are taught about the Hurwitz Criterion) is the most difficult course in the undergraduate Computer Science curriculum. It makes me think about dropping out, even if I only have two courses left before the diploma (I still haven't passed my Komunikacijske Vještine class).

[Angrboda]

[BrianSoddingBoru4]

I don’t know.

Boru

I think the Osnove Automatskog Upravljanja (where we are taught about the Hurwitz Criterion) is the most difficult course in the undergraduate Computer Science curriculum. It makes me think about dropping out, even if I only have two courses left before the diploma (I still haven't passed my Komunikacijske Vještine class).

Well, if you drop out of you programming course, it’ll give you more time to focus on boring philology and wrong nutrition. 

Boru

[arewethereyet]

Take two sesame seeds, wash it down with raw heme iron, and call the doctor in the morning.

[zebo-the-fat]

Fish!

[FlatAssembler]

Try T0T0 instead.

It's in Kansas.

Or Africa.

Just watch out for the rains.

Sorry, I don't understand what you mean. If that's supposed to be a joke, the question I asked in the OP is a serious question, so I expect serious responses.

[FlatAssembler]

I think the Osnove Automatskog Upravljanja (where we are taught about the Hurwitz Criterion) is the most difficult course in the undergraduate Computer Science curriculum. It makes me think about dropping out, even if I only have two courses left before the diploma (I still haven't passed my Komunikacijske Vještine class).

Well, if you drop out of you programming course, it’ll give you more time to focus on boring philology and wrong nutrition. 

Boru

Well, when studying names of places in Croatia, I really feel like I am discovering something important. Especially since I think I have discovered how to estimate p-values of the patterns in the names of places, using the collision entropy and birthday calculations.