Розроблення системи для підбору фільмів з використанням клієнт-серверної архітектури

2020 ◽  
pp. 87-92
Author(s):  
Роман Чолкан ◽  
◽  
Юрій Кинаш ◽  
Олег Різник ◽  
Олександр Вітер ◽  
...  
Keyword(s):  
Information Processing ◽  
Programming Language ◽  
Binary Search ◽  
Sorting Algorithms ◽  
Speed Up

The system for searching movies based on their parameters has been developed. C # 7 programming language based on WPF framework and Json, LinQ, .NET and XAML technology is used. Shell and quick sorting algorithms and binary search are used to speed up information processing. Using the developed system will save time when selecting films according to certain criteria.

COMPUTING LINE INTERSECTIONS

2001 ◽  
Vol 01 (02) ◽  
pp. 217-230 ◽  
Author(s):  
M. GAVRILOVA ◽  
J. ROKNE
Keyword(s):  
Intersection Point ◽  
Binary Search ◽  
Floating Point ◽  
Search Procedure ◽  
Single Precision ◽  
Exact Arithmetic ◽  
The Core ◽  
Speed Up ◽  
Computationally Expensive ◽  
Floating Point Numbers

The main result of the paper is a new and efficient algorithm to compute the closest possible representable intersection point between two lines in the plane. The coordinates of the points that define the lines are given as single precision floating-point numbers. The novelty of the algorithm is the method for deriving the best possible representable floating point numbers: instead of solving the equations to compute the line intersection coordinates exactly, which is a computationally expensive procedure, an iterative binary search procedure is applied. When the required precision is achieved, the algorithm stops. Only exact comparison tests are needed. Interval arithmetic is applied to further speed up the process. Experimental results demonstrate that the proposed algorithm is on the average ten times faster than an implementation of the line intersection computation subroutine using the CORE library exact arithmetic.

scholarly journals COMPARISON OF PROGRAMMING LANGUAGES ON THE IOS PLATFORM IN TERMS OF PERFORMANCE

2017 ◽  
Vol 7 (3) ◽  
pp. 33-36
Author(s):  
Kamil Gut ◽  
Maria Skublewska-Paszkowska ◽  
Edyta Łukasik ◽  
Jakub Smołka
Keyword(s):  
Programming Languages ◽  
Programming Language ◽  
Data Structures ◽  
Performance Comparison ◽  
Algorithms And Data Structures ◽  
Sorting Algorithms ◽  
Modern Programming Language

In 2014, Apple unveiled a completely new programming language for the iOS and OS X platforms. Swift was presented as a modern programming language, such as: safe, easy to learn and easy to use. This article presents the performance comparison between the Swift and Objective-C languages. For the purpose of the research, two applications were developed, one in each language, implementing sorting algorithms and data structures such as arrays, dictionaries and sets.

scholarly journals FROM PLANNING TO SEARCHING FOR THE SHORTEST PLAN: AN OPTIMAL TRANSITION

2001 ◽  
Vol 09 (06) ◽  
pp. 827-837 ◽  
Author(s):  
R. TREJO ◽  
J. GALLOWAY ◽  
C. SACHAR ◽  
V. KREINOVICH ◽  
C. BARAL ◽  
...  
Keyword(s):  
Computation Time ◽  
Binary Search ◽  
Planning Problem ◽  
Linear Search ◽  
Worst Case ◽  
Average Complexity ◽  
Case Complexity ◽  
Worst Case Complexity ◽  
Long Time ◽  
Speed Up

If we want to find the shortest plan, then usually, we try plans of length 1, 2, …, until we find the first length for which such a plan exists. When the planning problem is difficult and the shortest plan is of a reasonable length, this linear search can take a long time; to speed up the process, it has been proposed to use binary search instead. Binary search for the value of a certain parameter x is optimal when for each tested value x, we need the same amount of computation time; in planning, the computation time increases with the size of the plan and, as a result, binary search is no longer optimal. We describe an optimal way of combining planning algorithms into a search for the shortest plan – optimal in the sense of worst-case complexity. We also describe an algorithm which is asymptotically optimal in the sense of average complexity.

Improved Double Selection Sort using Algorithm

2017 ◽  
Vol 9 (02) ◽  
pp. 85-88
Author(s):  
Nirupma Pathak ◽  
Shubham Tiwari
Keyword(s):  
Programming Language ◽  
Sorting Algorithm ◽  
C Programming Language ◽  
Sorting Technique ◽  
C Programming ◽  
Execution Speed ◽  
Speed Up ◽  
Popular Language ◽  
Sort Algorithm ◽  
Selection Of

In this paper, we present the work regarding the selection sorting technique for double ended selection sort. This sorting algorithm is both theoretical and programmatically analysis show that the introduce advance selection sort algorithm which enhances the performance of selection sort. It is much faster than the selection sort because of its selection of minimum and maximum elements simultaneously. Advance selection sort algorithm possibility of enhancing execution speed up to 30%. Code for this algorithm is written in C programming Language. So easy to understand the concept of this sorting algorithm by everyone because C is the popular language. Results and discusion show a higher level of performance for the sorting algorithm. It can theoretically prove that the algorithm can reduce steps with the selection short and will improve N2 sorts toward NlogN sort.

Sign in / Sign up

Export Citation Format

Share Document