Wace hanya ce za a iya kammala rarrabuwa a cikin mafi girman lokacin n2? Bisa ga tambayar da ta gabata, ka rubuta mahallin da ke ɗauke da amsar. Zai iya zama jumla 1 - 20. Abubuwan da ke ciki:
Misali, yi la'akari da algorithm mai rarrabewa mai sauri. Wannan ya warware matsalar rarraba jerin lambobi masu yawa da aka bayar a matsayin shigarwa. Mafi munin yanayin shine lokacin da aka tsara shigarwar ko aka tsara ta a cikin tsari na baya, kuma algorithm yana ɗaukar lokaci O ((n2) don wannan yanayin. Idan muka ɗauka cewa duk yiwuwar haɗuwa da jerin shigarwar suna da daidaito, matsakaicin lokacin da aka ɗauka don rarrabuwa shine O ((n log n). Mafi kyawun yanayin yana faruwa lokacin da kowane juyawa ya raba jerin a rabi, kuma yana buƙatar O ((n log n) lokaci.