function?[?out?]?=?inv_bin（?in?）
%INV_BIN?Summary?of?this?function?goes?here
%???Detailed?explanation?goes?here
%???計算二進制稀疏矩陣的逆
[mn]?=?size（in）;
if（m~=n）
???fprintf（‘m~=n\n‘）;
???return?;
end
E?=?eye（m）;
%%
%做行變換，變成下三角陣
for?i?=?1:m
????noneZerosIndex?=?find（in（:i））;??%i到end行，第i列非零元
????noneZerosIndex?=?noneZerosIndex（find（noneZerosIndex>=i））;
????if（length（noneZerosIndex）==0）??%該行為0
????????randIndex?=?randi（[i+1m]1）;
????????%列交換
????????temp?=?in（:i）;
????????in（:i）?=?in（:randIndex）;
????????in（:randIndex）?=?temp;
????????%E交換
????????temp?=?E（:i）;
????????E（:i）?=?E（:randIndex）;
?????