PSRS analysis (parallel sorting using regular sampling) In the calculation part. Why is Big-o sorting regular patterns: O (p ^ 2 log p ^ 2) = O (p ^ 2 log p)? Thanks for answering.
Since log p² = 2 log p (which is a property of the logarithms) and using the Big-O notation you can ignore the multiplicative constant.
O (p ^ 2 log p ^ 2) = O (2p ^ 2 log p), according to the properties of the logarithms. And O (kg) = O (g), where k is a constant. Therefore, you can remove 2 to reach O (p ^ 2 log p).
Source: https://habr.com/ru/post/1787433/More articles:Windows Identity Foundation Integration with NServiceBus - wifCascade delete in EF4 CTP5 Code First updates the child records - c #SQL Server Vs MongoDB: Speed Test? - performanceMake file for javascript - javascriptmongoDB runs queries in the same way as SQL! - performanceIs there a way to enable two versions of the same artifact in Maven? - mavenIdentifiers starting with an integer - reflectionОтображение карты Google Google Google возвращает ошибку при использовании onTap() - предполагается, что будет показан Alertdialog - androidHow to move a directory to a new location on iPhone - objective-cHow to get GMail contacts in my iphone application - iphoneAll Articles