Table of Contents
- 1 What are the topics of algorithm?
- 2 What are the cases in complexity theory?
- 3 Which are the most important topics in data structures and algorithms?
- 4 What are the types of algorithm complexities?
- 5 What are some real world examples of algorithm?
- 6 What is research in algorithms and complexity theory?
What are the topics of algorithm?
Selection Sort, Bubble Sort, Insertion Sort, Merge Sort, Heap Sort, QuickSort, Radix Sort, Counting Sort, Bucket Sort, ShellSort, Comb Sort, Pigeonhole Sort, Cycle Sort. Interpolation search vs Binary search. Stability in sorting algorithms.
What are the cases in complexity theory?
Best, worst and average case complexity Best-case complexity: This is the complexity of solving the problem for the best input of size n. Average-case complexity: This is the complexity of solving the problem on an average. This complexity is only defined with respect to a probability distribution over the inputs.
How do you start a research algorithm?
Action Steps
- Select an algorithm that you want to research.
- Consider what you want to know about the algorithm and select the sources that can best answer your questions from the list above.
- Systematically research the algorithm. Start with Google Scholar and type in the algorithm name if you are looking for papers.
What are research algorithms?
Algorithm is a computer science term for a way of solving a problem, and it also refers to the instructions given to the computer to solve the problem. The study of algorithms is central to computer science and is of great practical importance to survey data analysis because algorithms are used in statistical programs.
Which are the most important topics in data structures and algorithms?
1 Answer
- Graph.
- Linked List.
- Dynamic Programming.
- Sorting And Searching.
- Tree / Binary Search Tree.
- Number Theory.
- BIT Manipulation.
- String / Array.
What are the types of algorithm complexities?
The complexity of an algorithm can be divided into two types. The time complexity and the space complexity.
What are the methods of algorithms?
Following are some of the main algorithm design techniques:
- Brute-force or exhaustive search.
- Divide and Conquer.
- Greedy Algorithms.
- Dynamic Programming.
- Branch and Bound Algorithm.
- Randomized Algorithm.
- Backtracking.
What are the steps in algorithm?
An Algorithm Development Process
- Step 1: Obtain a description of the problem. This step is much more difficult than it appears.
- Step 2: Analyze the problem.
- Step 3: Develop a high-level algorithm.
- Step 4: Refine the algorithm by adding more detail.
- Step 5: Review the algorithm.
What are some real world examples of algorithm?
6 Examples of Real-World Algorithms
- Sorting Papers. Imagine a teacher sorting their students’ papers according to the alphabetical order of their first names.
- Facial Recognition.
- Google Search.
- Duplicating Outcomes.
- Traffic Lights.
- Bus Schedules.
What is research in algorithms and complexity theory?
Research in Algorithms and Complexity Theory includes determining the inherent difficulty of computational problems, classifying problems according to this inherent difficulty, and designing and analysing algorithms that use computational resources as efficiently as possible.
What are the current research areas in game theory?
Currently, one hot research area in algorithmic game theory is fair divsion, which aims to design a methodology to allocate an infinitely divisible good, such as a cake, or a bundle of indivisible goods in an optimal manner.
What are the biggest open problems in game theory?
Indeed, many of the biggest open problems in game theory (in my view) are questions of how to model things correctly so as to describe people’s actual behavior, for which our existing equilibrium concepts are inadequate.