There are many methods of searching large amount of data to find one particular piece of information. Such as find name of person in record of mobile. Certain methods of organizing data make the search process more efficient the objective of these methods is to find the element with least cost (least time). Binary search algorithm is faster than sequential and other commonly used search algorithms. This research develops binary search algorithm by using new structure called Triple, structure in this structure data are represented as triple. It consists of three locations (1-Top, 2-Left, and 3-Right) Binary search algorithm divide the search interval in half, this process makes the maximum number of comparisons (Average case complexity of Search) is O(log2 n) (pronounce this "big-Oh-n" or "the order of magnitude"), if we search in a list consists of (N) elements. In this research the number of comparison is reduced to triple by using Triple structure, this process makes the maximum number of comparisons is O(log2 (n)/3+1) if we search key in list consist of (N) elements.
Jeder Lernende, der in der Fremdsprache Deutsch kommunizieren möchte, wird sich auch mit der deutschen Aussprache beschäftigen (müssen). Wer eine gute Aussprache hat, wird nicht nur oft und zu Recht bewundert, er hat es auch leichter, die deutsche Sprache zu verstehen, und er wird gut verstanden. Aussprachefehler beeinträchtigen die Kommunikation, sie führen zur Unverständlichkeit von Namen, Wörtern und Äußerungen oder Mißverständnissen, sie bewirken Ermüdung und Konzentrationsverluste und beeinträchtigen die Sprachverarbeitung durch Assoziationen und Emotionen, die beim Hörer entstehen können.’’[1]
Diese vorliegende Forschung befasst sich mit der Wic
... Show MoreThe research seeks to identify the contemporary events that face the use of electronic payment methods to localize the salaries of state employees and its impact in enhancing the mental image of customers, and to achieve this purpose from the fact that a questionnaire was designed and distributed to an optional sample of (31) individual customers (employees) dealing With the researched private banks, it has been analyzed and reached a number of conclusions and recommendations, the most prominent of which is the lack of modernity of electronic payment methods by customers, which is reflected in the mental image of customers and the achievement of their satisfaction, in the Emiratization project for salaries needs an advanced leade
... Show MoreThe aim of the current study is to create special norms of the second edition of Minnesota multi faces personality inventory, and the fifth edition of the sixteen personality factor questionnaire of catel. To this end, the researcher applied the Minnesota multi faces personality inventory over a sample of (1646) secondary and university students as well as plenty of disorders. She also applied the sixteen personality factor questionnaire of catel on (4700) secondary and university students. SPSS tools were used to process data.
Our goal in the present paper is to recall the concept of general fuzzy normed space and its basic properties in order to define the adjoint operator of a general fuzzy bounded operator from a general fuzzy normed space V into another general fuzzy normed space U. After that basic properties of the adjoint operator were proved then the definition of fuzzy reflexive general fuzzy normed space was introduced in order to prove that every finite dimensional general fuzzy normed space is fuzzy reflexive.
The significance fore supra topological spaces as a subject of study cannot be overstated, as they represent a broader framework than traditional topological spaces. Numerous scholars have proposed extension to supra open sets, including supra semi open sets, supra per open and others. In this research, a notion for ⱨ-supra open created within the generalizations of the supra topology of sets. Our investigation involves harnessing this style of sets to introduce modern notions in these spaces, specifically supra ⱨ - interior, supra ⱨ - closure, supra ⱨ - limit points, supra ⱨ - boundary points and supra ⱨ - exterior of sets. It has been examining the relationship with supra open. The research was also enriched with many
... Show MoreLet A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)-graph, if there is a nonempty subset A ⊆V(H) together with is the same for all . Here is known as the open distance pattern uniform (odpu-) labeling of the graph H and A is known as an odpu-set of H. The minimum cardinality of vertices in any odpu-set of H, if it exists, will be known as the odpu-number of the graph H. This article gives a characterization of maximal outerplanar-odpu graphs. Also, it establishes that the possible odpu-number of an odpu-maximal outerplanar graph i
... Show MoreThe aim of this article is to introduce a new definition of domination number in graphs called hn-domination number denoted by . This paper presents some properties which show the concepts of connected and independent hn-domination. Furthermore, some bounds of these parameters are determined, specifically, the impact on hn-domination parameter is studied thoroughly in this paper when a graph is modified by deleting or adding a vertex or deleting an edge.
In this work the concept of semi-generalized regular topological space was introduced and studied via semi generalized open sets. Many properties and results was investigated and studied, also it was shown that the quotient space of semi-generalized regular topological space is not, in general semi-generalizedspace.
A new type of the connected domination parameters called tadpole domination number of a graph is introduced. Tadpole domination number for some standard graphs is determined, and some bounds for this number are obtained. Additionally, a new graph, finite, simple, undirected and connected, is introduced named weaver graph. Tadpole domination is calculated for this graph with other families of graphs.