Return to Answer

No, we don't just rearrange code to make it prettier. Performance is specifically listed as one of our focus areas on What topics can I ask about here?

Many of our answers do address concrete performance issues. Sometimes those answers are in direct response to a request in the question. Other times we point out problems that the author didn't even know existed.

Examples:

• Collaboratively investigating a performance issue with multiple causes: Integer Partition using an iterator
• Effective use of input/output routines: toBase64 encoder
• Effective use of SQL: Creating an object oriented model in VBA using COM and ADODB from 2 depended SQL tables
• Optimization that requires a specialized data structure: Speed up counting sort algorithm in Ruby
• Text processing algorithm: Slowly working word counter
• Subtle pitfalls of implementing a sorting algorithm: Quicksort implementation in Python
• Replacing the whole sorting algorithm with a simpler one: A character array of arbitary length with 'R', 'B', 'W' is needed to be sorted in that order
• Performance comparison of regular expressions: Fast regex to extract strings before and after a time
• Squeezing more performance out of a string substitution function: Fastest way of removing a substring from a string
• Discussion about prime factoring strategies: Project Euler #3 - largest prime factor
• Discussing how Java and CPUs work, and doing microbenchmark comparisons: Efficiently checking if a number is divisible by 3

In particular, the performance, algorithm, complexity, and time-limit-exceeded tags all directly deal with increasing speed.

No, we don't just rearrange code to make it prettier. Performance is specifically listed as one of our focus areas on What topics can I ask about here?

Many of our answers do address concrete performance issues. Sometimes those answers are in direct response to a request in the question. Other times we point out problems that the author didn't even know existed.

Examples:

• Collaboratively investigating a performance issue with multiple causes: Integer Partition using an iterator
• Effective use of input/output routines: toBase64 encoder
• Effective use of SQL: Creating an object oriented model in VBA using COM and ADODB from 2 depended SQL tables
• Optimization that requires a specialized data structure: Speed up counting sort algorithm in Ruby
• Text processing algorithm: Slowly working word counter
• Subtle pitfalls of implementing a sorting algorithm: Quicksort implementation in Python
• Replacing the whole sorting algorithm with a simpler one: A character array of arbitary length with 'R', 'B', 'W' is needed to be sorted in that order
• Performance comparison of regular expressions: Fast regex to extract strings before and after a time
• Squeezing more performance out of a string substitution function: Fastest way of removing a substring from a string
• Discussion about prime factoring strategies: Project Euler #3 - largest prime factor
• Discussing how Java and CPUs work, and doing microbenchmark comparisons: Efficiently checking if a number is divisible by 3

In particular, the performance, algorithm, complexity, and time-limit-exceeded tags all directly deal with increasing speed.

No, we don't just rearrange code to make it prettier. Many of our answers do address concrete performance issues. Sometimes those answers are in direct response to a request in the question. Other times we point out problems that the author didn't even know existed.

Examples:

• Collaboratively investigating a performance issue with multiple causes: Integer Partition using an iterator
• Effective use of input/output routines: toBase64 encoder
• Effective use of SQL: Creating an object oriented model in VBA using COM and ADODB from 2 depended SQL tables
• Optimization that requires a specialized data structure: Speed up counting sort algorithm in Ruby
• Text processing algorithm: Slowly working word counter
• Subtle pitfalls of implementing a sorting algorithm: Quicksort implementation in Python
• Replacing the whole sorting algorithm with a simpler one: A character array of arbitary length with 'R', 'B', 'W' is needed to be sorted in that order
• Performance comparison of regular expressions: Fast regex to extract strings before and after a time
• Squeezing more performance out of a string substitution function: Fastest way of removing a substring from a string
• Discussion about prime factoring strategies: Project Euler #3 - largest prime factor
• Discussing how Java and CPUs work, and doing microbenchmark comparisons: Efficiently checking if a number is divisible by 3

In particular, the performance, algorithm, complexity, and time-limit-exceeded tags all directly deal with increasing speed.

No, we don't just rearrange code to make it prettier. Performance is specifically listed as one of our focus areas on What topics can I ask about here?

Many of our answers do address concrete performance issues. Sometimes those answers are in direct response to a request in the question. Other times we point out problems that the author didn't even know existed.

Examples:

• Collaboratively investigating a performance issue with multiple causes: Integer Partition using an iterator
• Effective use of input/output routines: toBase64 encoder
• Effective use of SQL: Creating an object oriented model in VBA using COM and ADODB from 2 depended SQL tables
• Optimization that requires a specialized data structure: Speed up counting sort algorithm in Ruby
• Text processing algorithm: Slowly working word counter
• Subtle pitfalls of implementing a sorting algorithm: Quicksort implementation in Python
• Replacing the whole sorting algorithm with a simpler one: A character array of arbitary length with 'R', 'B', 'W' is needed to be sorted in that order
• Performance comparison of regular expressions: Fast regex to extract strings before and after a time
• Squeezing more performance out of a string substitution function: Fastest way of removing a substring from a string
• Discussion about prime factoring strategies: Project Euler #3 - largest prime factor
• Discussing how Java and CPUs work, and doing microbenchmark comparisons: Efficiently checking if a number is divisible by 3

In particular, the performance, algorithm, complexity, and time-limit-exceeded tags all directly deal with increasing speed.

No, we don't just rearrange code to make it prettier. Many of our answers do address concrete performance issues. Sometimes those questions are in direct response to a request in the question. Sometimes we just point out problems that the author didn't even know existed.

Examples:

• Collaboratively investigating a performance issue with multiple causes: Integer Partition using an iterator
• Effective use of input/output routines: toBase64 encoder
• Effective use of SQL: Creating an object oriented model in VBA using COM and ADODB from 2 depended SQL tables
• Optimization that requires a specialized data structure: Speed up counting sort algorithm in Ruby
• Text processing algorithm: Slowly working word counter
• Subtle pitfalls of implementing a sorting algorithm: Quicksort implementation in Python
• Replacing the whole sorting algorithm with a simpler one: A character array of arbitary length with 'R', 'B', 'W' is needed to be sorted in that order
• Performance comparison of regular expressions: Fast regex to extract strings before and after a time
• Squeezing more performance out of a string substitution function: Fastest way of removing a substring from a string
• Discussion about prime factoring strategies: Project Euler #3 - largest prime factor
• Discussing how Java and CPUs work, and doing microbenchmark comparisons: Efficiently checking if a number is divisible by 3

In particular, the performance, algorithm, complexity, and time-limit-exceeded tags all directly deal with increasing speed.

No, we don't just rearrange code to make it prettier. Many of our answers do address concrete performance issues. Sometimes those answers are in direct response to a request in the question. Other times we point out problems that the author didn't even know existed.

Examples:

• Collaboratively investigating a performance issue with multiple causes: Integer Partition using an iterator
• Effective use of input/output routines: toBase64 encoder
• Effective use of SQL: Creating an object oriented model in VBA using COM and ADODB from 2 depended SQL tables
• Optimization that requires a specialized data structure: Speed up counting sort algorithm in Ruby
• Text processing algorithm: Slowly working word counter
• Subtle pitfalls of implementing a sorting algorithm: Quicksort implementation in Python
• Replacing the whole sorting algorithm with a simpler one: A character array of arbitary length with 'R', 'B', 'W' is needed to be sorted in that order
• Performance comparison of regular expressions: Fast regex to extract strings before and after a time
• Squeezing more performance out of a string substitution function: Fastest way of removing a substring from a string
• Discussion about prime factoring strategies: Project Euler #3 - largest prime factor
• Discussing how Java and CPUs work, and doing microbenchmark comparisons: Efficiently checking if a number is divisible by 3

In particular, the performance, algorithm, complexity, and time-limit-exceeded tags all directly deal with increasing speed.