Algorithmic efficiency
In computer science, algorithmic efficiency is a property of an algorithm which relates to the amount of computational resources used by the algorithm. An algorithm must be analyzed to determine its resource usage, and the efficiency of an algorithm can be measured based on the usage of different resources. Algorithmic efficiency can be thought of as analogous to engineering productivity for a repeating or continuous process.
- Comment
- enIn computer science, algorithmic efficiency is a property of an algorithm which relates to the amount of computational resources used by the algorithm. An algorithm must be analyzed to determine its resource usage, and the efficiency of an algorithm can be measured based on the usage of different resources. Algorithmic efficiency can be thought of as analogous to engineering productivity for a repeating or continuous process.
- Depiction
- Has abstract
- enIn computer science, algorithmic efficiency is a property of an algorithm which relates to the amount of computational resources used by the algorithm. An algorithm must be analyzed to determine its resource usage, and the efficiency of an algorithm can be measured based on the usage of different resources. Algorithmic efficiency can be thought of as analogous to engineering productivity for a repeating or continuous process. For maximum efficiency it is desirable to minimize resource usage. However, different resources such as time and space complexity cannot be compared directly, so which of two algorithms is considered to be more efficient often depends on which measure of efficiency is considered most important. For example, bubble sort and timsort are both algorithms to sort a list of items from smallest to largest. Bubble sort sorts the list in time proportional to the number of elements squared , but only requires a small amount of extra memory which is constant with respect to the length of the list. Timsort sorts the list in time linearithmic (proportional to a quantity times its logarithm) in the list's length, but has a space requirement linear in the length of the list. If large lists must be sorted at high speed for a given application, timsort is a better choice; however, if minimizing the memory footprint of the sorting is more important, bubble sort is a better choice.
- Hypernym
- Properties
- Is primary topic of
- Algorithmic efficiency
- Label
- enAlgorithmic efficiency
- Link from a Wikipage to an external page
- msdn.microsoft.com/en-us/library/ff647790.aspx
- Link from a Wikipage to another Wikipage
- 2001: A Space Odyssey
- Ada Lovelace
- Algorithm
- Analysis of algorithms
- Analysis of parallel algorithms
- Apache Hadoop
- Application programming interface
- Arithmetic coding
- Arithmetic logic unit
- ARM architecture
- Arthur C. Clarke
- Associative array
- Asymptote
- Auxiliary memory
- Backward compatibility
- Benchmark (computing)
- Best, worst and average case
- Big O notation
- Binary search algorithm
- Binomial heap
- Boolean satisfiability problem
- Branch prediction
- Branch table
- Brute-force search
- Bubble sort
- Cache (computing)
- Cache-aware model
- Cache coherence
- Cache hierarchy
- Cache miss
- Cache replacement policies
- Category:Analysis of algorithms
- Category:Computer performance
- Category:Software optimization
- Category:Software quality
- Central processing unit
- Charles Babbage
- Chief technical officer
- Clock cycle
- Code generation (compiler)
- Comparison of programming paradigms
- Compiler
- Compiler optimization
- Computational complexity of mathematical operations
- Computational complexity theory
- Computational resource
- Computer memory
- Computer performance
- Computer science
- Computer Science
- Computer scientist
- Constant time
- CPU cache
- CPU core
- CPU time
- CUDA
- Data alignment
- Database index
- Data compression
- Data structure alignment
- David May (computer scientist)
- Distributed computing
- Do it yourself
- Donald Knuth
- Douglas Adams
- Dynamic programming
- Dynamic random-access memory
- Eager execution
- Electronic computer
- Electronic Delay Storage Automatic Calculator
- Embedded system
- Entropy encoding
- Event-driven programming
- Exponential time
- Fast Fourier transform
- File:Google.png
- Floating-point arithmetic
- Floating-point unit
- Function (mathematics)
- Function call
- Garbage collection (computer science)
- Gigabyte
- GPU memory
- Granularity
- Green computing
- HAL 9000
- Hard disk drive
- Hash function
- Heapsort
- High-level programming language
- Huffman algorithm
- Hyper-threading
- IBM
- In-place algorithm
- Input (computer science)
- Insertion sort
- Instruction-level parallelism
- Instruction set architecture
- Internet of things
- Interpreted language
- Interpreter (computing)
- Judy array
- Just-in-time compilation
- L1 cache
- L2 cache
- L3 cache
- Laptop
- Latency (engineering)
- Library (computing)
- Limit (mathematics)
- Linearithmic
- Linearithmic time
- Linear time
- Linking (computing)
- Locality of reference
- Local variable
- Local variables, recursion and reentrancy
- Logarithmic time
- Long multiplication
- Lookup table
- Loop optimization
- Lower-order terms
- Low-power computing
- Machine code
- Mainframe computer
- Mainframe sort merge
- Main memory
- Megabyte
- Memory hierarchy
- Memory management
- Merge sort
- Message Passing Interface
- Microcontroller
- Moore's law
- Multi-core processor
- Multiplication
- Multi-processing
- Multi-programming
- Multithreading (disambiguation)
- Object code optimizer
- O bound computing
- OpenMP
- Operating system
- Optimization (computer science)
- Optimizing compiler
- Orders of magnitude (computing)
- Output (computing)
- Page fault
- Parallel algorithm
- Parallel computing
- Patricia tree
- Personal computer
- Principle of locality
- Processor (computing)
- Processor core
- Processor register
- Productivity
- Professor
- Profiling (computer programming)
- Program optimization
- Proportionality (mathematics)
- Quadratic time
- Quicksort
- Random access memory
- Random-access memory
- Real-time computing
- Recursion (computer science)
- Register file
- Response time (technology)
- Ripple carry adder
- Run-time analysis
- Scalability
- Secondary storage device
- Selection sort
- Server (computing)
- Server farm
- Shared cache
- Shell sort
- SIMD
- Simultaneous multithreading
- Smartphone
- Software emulation
- Sorting algorithm
- Space complexity
- Space–time trade-off
- Spatial locality
- Speculative execution
- Static random-access memory
- Subroutine
- Supercomputer
- Super-threading
- Syncsort
- System-on-chip
- Task (computing)
- Temporal locality
- TensorFlow
- The Computer Language Benchmarks Game
- Threaded code
- Time complexity
- Time-space tradeoff
- Timsort
- Total cost of ownership
- Travelling salesman problem
- Tree data structure
- United Kingdom
- University of Bristol
- Variable-length code
- Vector processor
- Virtual machine
- Virtual memory
- Virtual method table
- Wired magazine
- Wirth's law
- X86-64
- XMOS
- ZX80
- SameAs
- 4013585-8
- 4066424-7
- 7hv4
- Algorithmic efficiency
- Algoritmisk effektivitet
- Djelotvornost
- Doelmatigheid
- Efektivnost algoritmu
- Efektívnosť algoritmu
- Effektivitet
- Effektivitet
- Efficience
- Effizienz (Informatik)
- Eficiencia
- Eficiência
- Eficiencia algorítmica
- Eficiența algoritmilor
- Efikasnost
- Hatékonyság
- Hiệu suất
- m.012f3k
- Q1034411
- Q1296251
- Učinkovitost
- Účinnosť (technika)
- Wydajność oprogramowania
- Αποδοτικότητα
- Алгоритамска ефикасност
- Ефективність
- Ефективність алгоритму
- Ефикасност
- Ефикасност
- Эффективность (философия)
- Эффективность алгоритма
- יעילות אלגוריתמית
- بازده
- كفاءة
- كفاءة خوارزمية
- کارآیی الگوریتمی
- दक्षता
- ประสิทธิภาพ
- 効率
- 效率
- 算法效率
- Subject
- Category:Analysis of algorithms
- Category:Computer performance
- Category:Software optimization
- Category:Software quality
- Thumbnail
- WasDerivedFrom
- Algorithmic efficiency?oldid=1106368338&ns=0
- WikiPageLength
- 32020
- Wikipage page ID
- 145128
- Wikipage revision ID
- 1106368338
- WikiPageUsesTemplate
- Template:As of
- Template:Authority control
- Template:Computer science
- Template:Distinguish
- Template:Further
- Template:Reflist
- Template:Section link
- Template:Short description
- Template:Software quality
- Template:Times
- Template:Use dmy dates
