Upgrade to Pro — share decks privately, control downloads, hide ads and more …

PHPerのための計算量入門 / Basic Knowledge of Time Complexity

PHPerのための計算量入門 / Basic Knowledge of Time Complexity

Time Complexity 101 for PHPer

Ryo Tomidokoro

March 30, 2019
Tweet

More Decks by Ryo Tomidokoro

Other Decks in Technology

Transcript

  1. 配列操作関数の計算量 O(1) O(n) O(n^2) array_key_exists array_key_first array_key_last array_push array_pop array_combine

    array_flip array_keys array_map array_rand array_shift array_sum array_unique array_values arsort asort in_array array + array range array_fill array_intersect array_merge