In　the　problem　of　crossing　distribution　of　circuit　wires　between　two　regions,　the　current　algorithms　of　using　either　linear　list　or　dynamic　programming　have　the　complexity　of　O(n　2).　In　order　to　reduce　the　complexity　of　the　existing　algorithms,　a　more　efficient　algorithm　of　using　indexed　binary　search　tree　is　introduced　in　this　paper.　The　effectiveness　of　the　algorithm　with　a　time　consuming　complexity　of　O(nlogn)　is　illustrated　through　the　theoretical　analysis　and　by　demonstrating　the　experiment　results　of　corresponding　C++　program.　©　2011　IEEE.