computer-science

相关标签：javascript jquery android 多少钱 iPhone

Real life, non-programming 'implementations' of design patterns

I am having a hard time trying to understand some of the design patterns, particularly the differences between some of them, such as proxy, delegate and adapter. Since design patterns are supposed to[详细]

2023-02-11 20:44 分类：问答
How to determine if a language is recursive or recursively enumerable?

I have to determine whether a language (for example L={a^n b^m c^s | 0<=n<=m<=s}) is regular, context-free, recursive, recursively enumerable or none of them.[详细]

2023-02-11 02:24 分类：问答
Borrowing books a library data structure

First off, I would like to mention the question is a homework question. I have been pondering about the implementation for long enough.[详细]

2023-02-10 16:54 分类：问答
Generic and practical sorting algorithm faster than O(n log n)?

Is there any practical开发者_StackOverflow社区 algorithm for generic elements (unlike counting sort or bucket sort) that runs faster than O(n log n)?Many people have mentioned the information-theoreti[详细]

2023-02-10 04:46 分类：问答
What is the most efficient way to find elements in an unsorted list?

Given an unsorted list in an array, will it necessarily take at least linear time to 开发者_JAVA百科find the number of elements smaller than x? If so, why?Yes, you would need to examine every number a[详细]

2023-02-09 04:14 分类：问答
Efficiently determining the bounds of a set

I\'m writing an AI for an RTS game, using the API the game offers. One thing I want to do is determine a set of line segments bounding the enemy nation, However, the game only offers a function which[详细]

2023-02-08 15:36 分类：问答
complexity of foo algorithm

I have this problem that I can\'t solve.. what is t开发者_如何学Pythonhe complexity of this foo algorithm?[详细]

2023-02-08 09:57 分类：问答
Big Oh Notation and Calculating the Running Time for a Triple-Nested For-Loop

In Computer Science, it is very important for Computer Scientists to know how to calculate the running times of algorithms in order to optimize code. For you Computer Scientists, I pose a question.[详细]

2023-02-07 05:48 分类：问答
Are .NET's regular expressions Turing complete?

Regular expressions are often pointed to as the classical example of a language that is not Turning complete. For example \"regular expressions\" is given in as the answer to this SO question looking[详细]

2023-02-07 03:50 分类：问答
What are Source-Level Statements?

What are \"source-level statements\"? \"Algorithm determines both the number of source-level statements and the number of I/O operations executed\" from Computer 开发者_C百科Organization and DesignSt[详细]

2023-02-06 14:14 分类：问答