mirror of
https://github.com/krahets/hello-algo.git
synced 2026-11-21 03:03:45 +08:00
* Retranslate the complete English edition from Simplified Chinese * Polish three English explanations after reader-focused review
131 lines
2.5 KiB
Go
131 lines
2.5 KiB
Go
// File: time_complexity.go
|
|
// Created Time: 2022-12-13
|
|
// Author: msk397 (machangxinq@gmail.com)
|
|
|
|
package chapter_computational_complexity
|
|
|
|
/* Constant complexity */
|
|
func constant(n int) int {
|
|
count := 0
|
|
size := 100000
|
|
for i := 0; i < size; i++ {
|
|
count++
|
|
}
|
|
return count
|
|
}
|
|
|
|
/* Linear complexity */
|
|
func linear(n int) int {
|
|
count := 0
|
|
for i := 0; i < n; i++ {
|
|
count++
|
|
}
|
|
return count
|
|
}
|
|
|
|
/* Linear complexity (array traversal) */
|
|
func arrayTraversal(nums []int) int {
|
|
count := 0
|
|
// The number of iterations is proportional to the array length
|
|
for range nums {
|
|
count++
|
|
}
|
|
return count
|
|
}
|
|
|
|
/* Quadratic complexity */
|
|
func quadratic(n int) int {
|
|
count := 0
|
|
// The number of iterations is proportional to the square of the input size n
|
|
for i := 0; i < n; i++ {
|
|
for j := 0; j < n; j++ {
|
|
count++
|
|
}
|
|
}
|
|
return count
|
|
}
|
|
|
|
/* Quadratic complexity (bubble sort) */
|
|
func bubbleSort(nums []int) int {
|
|
count := 0 // Counter
|
|
// Outer loop: the unsorted range is [0, i]
|
|
for i := len(nums) - 1; i > 0; i-- {
|
|
// Inner loop: move the largest element in the unsorted range [0, i] to its right end through swaps
|
|
for j := 0; j < i; j++ {
|
|
if nums[j] > nums[j+1] {
|
|
// Swap nums[j] and nums[j + 1]
|
|
tmp := nums[j]
|
|
nums[j] = nums[j+1]
|
|
nums[j+1] = tmp
|
|
count += 3 // Swapping two elements takes 3 elementary operations
|
|
}
|
|
}
|
|
}
|
|
return count
|
|
}
|
|
|
|
/* Exponential complexity (iterative implementation)*/
|
|
func exponential(n int) int {
|
|
count, base := 0, 1
|
|
// Each cell divides into two per round, giving the sequence 1, 2, 4, 8, ..., 2^(n-1)
|
|
for i := 0; i < n; i++ {
|
|
for j := 0; j < base; j++ {
|
|
count++
|
|
}
|
|
base *= 2
|
|
}
|
|
// count = 1 + 2 + 4 + 8 + .. + 2^(n-1) = 2^n - 1
|
|
return count
|
|
}
|
|
|
|
/* Exponential complexity (recursive implementation)*/
|
|
func expRecur(n int) int {
|
|
if n == 1 {
|
|
return 1
|
|
}
|
|
return expRecur(n-1) + expRecur(n-1) + 1
|
|
}
|
|
|
|
/* Logarithmic complexity (iterative implementation)*/
|
|
func logarithmic(n int) int {
|
|
count := 0
|
|
for n > 1 {
|
|
n = n / 2
|
|
count++
|
|
}
|
|
return count
|
|
}
|
|
|
|
/* Logarithmic complexity (recursive implementation)*/
|
|
func logRecur(n int) int {
|
|
if n <= 1 {
|
|
return 0
|
|
}
|
|
return logRecur(n/2) + 1
|
|
}
|
|
|
|
/* Linearithmic complexity */
|
|
func linearLogRecur(n int) int {
|
|
if n <= 1 {
|
|
return 1
|
|
}
|
|
count := linearLogRecur(n/2) + linearLogRecur(n/2)
|
|
for i := 0; i < n; i++ {
|
|
count++
|
|
}
|
|
return count
|
|
}
|
|
|
|
/* Factorial complexity (recursive implementation) */
|
|
func factorialRecur(n int) int {
|
|
if n == 0 {
|
|
return 1
|
|
}
|
|
count := 0
|
|
// Split one problem into n subproblems
|
|
for i := 0; i < n; i++ {
|
|
count += factorialRecur(n - 1)
|
|
}
|
|
return count
|
|
}
|