I am looking for a solution better than n-square for this problem :

minimum adjacent swap required to bring all 'b' character together. like below

example:
aabaaabab : require 4 swap to get aaaaabbba
abbaab : require 2 step to get abbbaa