11. Z = ∅ ; S = X 0 ; K = 0 ; B = 0
12. While S ≠ ∅
13. X = P o p ( S ) ; S = S − X ;
14. if 0 ∈ F ( X )
15. if w i d ( X ) < 10 − 14
16. Z = Z ∪ X ;
17. else
18. computing P L = P L ( X , N L ( X ) ) , P U = P U ( X , N U ( X ) ) and P = P L ⊔ P U
19. r = [ min { P L ¯ , P U ¯ } , max { P L _ , P U _ } ]
20. if 0 ∈ F ′ ( X )
21. if 0 ∈ F ( m ( X ) ) ¯ or 0 ∈ F ( X ) _ or X ⊂ P
22. Bisect X = ( X 1 , X 2 )
23. B = B + 1 ;
24. S = S ∪ X 1 ∪ X 2 ;
25. elseif 0 ∉ F ( m ( X ) )
26. r = ∅ ;
27. end
28. end
29. X 1 = P L ∩ X ;
30. X 2 = P U ∩ X ;
31. S = S ∪ X 1 ∪ X 2 ;
32. if r ≠ ∅
33. Z = Z ∪ { r ∩ X } ;
34. end
35. end
36. end
37. K = K + 1 ;
38. end