HTML Microdata document

This HTML5 document contains 187 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

Prefix	IRI
dcterms	http://purl.org/dc/terms/
dbo	http://dbpedia.org/ontology/
n23	http://dbpedia.org/resource/File:
foaf	http://xmlns.com/foaf/0.1/
dbpedia-ko	http://ko.dbpedia.org/resource/
dbpedia-es	http://es.dbpedia.org/resource/
n20	https://global.dbpedia.org/id/
dbt	http://dbpedia.org/resource/Template:
rdfs	http://www.w3.org/2000/01/rdf-schema#
dbpedia-sr	http://sr.dbpedia.org/resource/
freebase	http://rdf.freebase.com/ns/
dbpedia-pt	http://pt.dbpedia.org/resource/
dbpedia-fa	http://fa.dbpedia.org/resource/
n17	http://commons.wikimedia.org/wiki/Special:FilePath/
dbpedia-no	http://no.dbpedia.org/resource/
rdf	http://www.w3.org/1999/02/22-rdf-syntax-ns#
dbpedia-ar	http://ar.dbpedia.org/resource/
owl	http://www.w3.org/2002/07/owl#
wikipedia-en	http://en.wikipedia.org/wiki/
dbp	http://dbpedia.org/property/
dbc	http://dbpedia.org/resource/Category:
prov	http://www.w3.org/ns/prov#
dbpedia-th	http://th.dbpedia.org/resource/
xsdh	http://www.w3.org/2001/XMLSchema#
wikidata	http://www.wikidata.org/entity/
dbr	http://dbpedia.org/resource/

Statements

Subject Item: dbr:Quicksort
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:Probabilistic_analysis_of_algorithms
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:Probabilistic_numerics
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:Best-case_execution_time
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case
dbo:wikiPageRedirects: dbr:Best,_worst_and_average_case

Subject Item: dbr:Best_case_execution_time
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case
dbo:wikiPageRedirects: dbr:Best,_worst_and_average_case

Subject Item: dbr:Binary_heap
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:Binary_search_algorithm
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:Binary_search_tree
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:Algorithmic_efficiency
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:Best,_worst_and_average_case
rdf:type: owl:Thing
rdfs:label: Best, worst and average case حالة سلوك خوارزمية Melhor caso, pior caso e caso médio Casos peor, mejor y promedio 최선, 최악, 그리고 평균의 경우
rdfs:comment: En análisis de algoritmos, los términos caso peor, caso mejor y caso promedio tienen los siguientes significados: * Caso mejor: se refiere a la situación inicial de los datos que genera una ejecución del algoritmo con una menor complejidad computacional. * Caso peor: se refiere a la situación inicial de los datos que genera una ejecución del algoritmo con una complejidad computacional mayor. * Caso promedio: la situación inicial de los datos no sigue ningún patrón preestablecido que aporte ventajas o desventajas. Se puede considerar, por tanto, la situación típica de ejecución del algoritmo. في علم الحاسوب، تعبر الحالات المثلى، الأسوأ، والوسطى من خوارزمية معينة عن استخدام موارد النظام على الأقل، على الأكثر وفي المتوسط، على التوالي. عادة ما يكون المورد قيد النظر هو وقت التشغيل، أي تعقيد الوقت، ولكن يمكن أن تكون أيضًا ذاكرة أو مورد آخر. الحالة المثلى هي الوظيفة التي تؤدي الحد الأدنى من الخطوات على بيانات إدخال عناصر ن. أسوأ حالة هي الوظيفة التي تؤدي الحد الأقصى لعدد الخطوات على بيانات الإدخال بالحجم ن. الحالة الوسطى هو الوظيفة التي تؤدي متوسط عدد الخطوات على بيانات إدخال عناصر ن. 컴퓨터 과학분야에서, 주어진 알고리즘의 최선, 최악, 그리고 평균의 경우(best, worst, and average cases)는 각 최소, 최대, 평균 자원의 사용량을 의미한다. 보통 여기서 고려하는 자원은 실행시간 (예, 시간 복잡도:time complexity), 메모리 또는 기타 다른 자원들이다. 최악의 경우 알고리즘이 항상 제시간 안에 끝나는 것을 보장하기 위하여 얼마의 시간 걸리는지 아는 것은 중요하다. 그렇기 때문에 실시간 연산시 최악의 실행 시간은 중요 고려사항이 된다. 알고리즘 분석시 평균 성능과 최악의 경우 성능이 가장 많이 활용된다. 최선의 경우 성능은 가장 적게 활용되나 때때로 유용하게 사용된다. 예를 들어 개별 작업의 최선의 경우 성능을 알고있다면, 이를 통해서 전반적인 최악의 경우 분석의 정확도를 향상 시킬수 있다. 예상 실행 시간을 계산하기 위하여 컴퓨터 과학자들은 확률적 분석 기술들을 사용하며, 특히 기대값(expected value)을 활용한다. Na ciência da computação, melhor caso, pior caso, e o caso médio de um determinado algoritmo, expressa a quantidade de recurso usado nesse algoritmo, no mínimo, no máximo e em média, respectivamente. Normalmente, o recurso a ser considerado é o tempo de execução, isto é, complexidade do tempo, porém poderia ser também a quantidade de memória usada ou outros recursos. In computer science, best, worst, and average cases of a given algorithm express what the resource usage is at least, at most and on average, respectively. Usually the resource being considered is running time, i.e. time complexity, but could also be memory or some other resource.Best case is the function which performs the minimum number of steps on input data of n elements. Worst case is the function which performs the maximum number of steps on input data of size n. Average case is the function which performs an average number of steps on input data of n elements.
rdfs:seeAlso: dbr:Sorting_algorithm dbr:Search_data_structure
foaf:depiction: n17:Comparison_computational_complexity.svg
dcterms:subject: dbc:Computational_complexity_theory dbc:Analysis_of_algorithms
dbo:wikiPageID: 37956
dbo:wikiPageRevisionID: 1113464102
dbo:wikiPageWikiLink: dbr:Smoothed_analysis dbr:Queue_(abstract_data_type) dbr:Linear_search dbr:Interval_finite_element dbr:Worst-case_circuit_analysis dbr:Worst-case_execution_time dbr:Stack_(abstract_data_type) dbr:K-d_tree dbr:Amortized_analysis dbc:Computational_complexity_theory dbr:Engineering_tolerance dbr:Skip_list dbr:Operation_(mathematics) dbr:Dynamic_array dbr:Array dbr:Insertion_sort dbr:Singly_linked_list dbr:B-tree dbr:Real-time_computing dbr:Random_self-reducibility dbr:Quicksort dbr:Doubly_linked_list dbr:Bogosort dbr:Splay_tree dbr:String_(computer_science) dbr:Hash_table dbr:Average-case_complexity dbr:Cryptography dbr:Algorithm dbr:AVL_tree dbr:Online_algorithm dbr:Search_data_structure dbr:Time_complexity dbr:Binary_search_tree dbc:Analysis_of_algorithms dbr:Computer_science dbr:Sorting_algorithm dbr:Cartesian_tree dbr:Red–black_tree dbr:Computer_scientist dbr:Expected_value dbr:Resource_(computer_science) dbr:Best-case_performance dbr:Big_O_notation dbr:Worst-case_complexity n23:Comparison_computational_complexity.svg dbr:Probabilistic_analysis dbr:Worst-case_performance
owl:sameAs: dbpedia-fa:حالت‌های_بهترین،_بدترین_و_متوسط dbpedia-ar:حالة_سلوك_خوارزمية freebase:m.09gj0 dbpedia-sr:Најбољи,_најгори_и_просечан_случај dbpedia-ko:최선,_최악,_그리고_평균의_경우 dbpedia-no:Det_beste,_verste_og_gjennomsnittlige_tilfelle n20:nUzv dbpedia-th:กรณีดีที่สุด_แย่ที่สุด_และกรณีเฉลี่ย dbpedia-pt:Melhor_caso,_pior_caso_e_caso_médio wikidata:Q186094 dbpedia-es:Casos_peor,_mejor_y_promedio
dbp:wikiPageUsesTemplate: dbt:Anchor dbt:Unreferenced_section dbt:Sdash dbt:See dbt:See_also dbt:Redirect dbt:Short_description dbt:Refimprove dbt:Reflist
dbo:thumbnail: n17:Comparison_computational_complexity.svg?width=300
dbo:abstract: في علم الحاسوب، تعبر الحالات المثلى، الأسوأ، والوسطى من خوارزمية معينة عن استخدام موارد النظام على الأقل، على الأكثر وفي المتوسط، على التوالي. عادة ما يكون المورد قيد النظر هو وقت التشغيل، أي تعقيد الوقت، ولكن يمكن أن تكون أيضًا ذاكرة أو مورد آخر. الحالة المثلى هي الوظيفة التي تؤدي الحد الأدنى من الخطوات على بيانات إدخال عناصر ن. أسوأ حالة هي الوظيفة التي تؤدي الحد الأقصى لعدد الخطوات على بيانات الإدخال بالحجم ن. الحالة الوسطى هو الوظيفة التي تؤدي متوسط عدد الخطوات على بيانات إدخال عناصر ن. في الحوسبة في الزمن الحقيقي، غالبًا ما يكون وقت التنفيذ الأسوأ مصدرًا للقلق بشكل خاص لأنه من المهم معرفة مقدار الوقت الذي قد يكون مطلوبًا في أسوأ الحالات لضمان انتهاء الخوارزمية دائمًا في الوقت المحدد. أداء الوسطى وأسوأ حالة هي الأكثر استخدامًا في تحليل الخوارزمية. أقل ما يتم العثور عليه على نطاق واسع هو أفضل أداء، ولكن له استخدامات: على سبيل المثال، حيث تُعرف أفضل حالات المهام الفردية، يمكن استخدامها لتحسين دقة تحليل أسوأ الحالات بشكل عام. يستخدم علماء الحاسوب تقنيات التحليل الاحتمالي، وخاصة القيمة المتوقعة، لتحديد أوقات التشغيل المتوقعة. تستخدم المصطلحات في سياقات أخرى؛ على سبيل المثال، أسوأ وأفضل نتيجة لوباء مخطط له، وأسوأ درجة حرارة يتعرض لها عنصر الدارة الإلكترونية، إلخ. عند استخدام مكونات التفاوت الهندسي المسموح، يجب تصميم الأجهزة لتعمل بشكل صحيح مع مجموعة أسوأ حالات التسامح والظروف الخارجية. En análisis de algoritmos, los términos caso peor, caso mejor y caso promedio tienen los siguientes significados: * Caso mejor: se refiere a la situación inicial de los datos que genera una ejecución del algoritmo con una menor complejidad computacional. * Caso peor: se refiere a la situación inicial de los datos que genera una ejecución del algoritmo con una complejidad computacional mayor. * Caso promedio: la situación inicial de los datos no sigue ningún patrón preestablecido que aporte ventajas o desventajas. Se puede considerar, por tanto, la situación típica de ejecución del algoritmo. En el caso de los algoritmos de ordenamiento o clasificación, la complejidad computacional está determinada por el número de comparaciones y de asignaciones entre elementos del conjunto que se realiza en una implementación específica del algoritmo. Por ejemplo, en el algoritmo de Inserción directa el caso mejor se presenta cuando el conjunto de elementos a ordenar se encuentra ya ordenado. En ese caso, los valores representativos son los siguientes: donde y son el número mínimo de comparaciones y el número mínimo de movimientos entre elementos del conjunto de datos del algoritmo de Inserción directa. 컴퓨터 과학분야에서, 주어진 알고리즘의 최선, 최악, 그리고 평균의 경우(best, worst, and average cases)는 각 최소, 최대, 평균 자원의 사용량을 의미한다. 보통 여기서 고려하는 자원은 실행시간 (예, 시간 복잡도:time complexity), 메모리 또는 기타 다른 자원들이다. 최악의 경우 알고리즘이 항상 제시간 안에 끝나는 것을 보장하기 위하여 얼마의 시간 걸리는지 아는 것은 중요하다. 그렇기 때문에 실시간 연산시 최악의 실행 시간은 중요 고려사항이 된다. 알고리즘 분석시 평균 성능과 최악의 경우 성능이 가장 많이 활용된다. 최선의 경우 성능은 가장 적게 활용되나 때때로 유용하게 사용된다. 예를 들어 개별 작업의 최선의 경우 성능을 알고있다면, 이를 통해서 전반적인 최악의 경우 분석의 정확도를 향상 시킬수 있다. 예상 실행 시간을 계산하기 위하여 컴퓨터 과학자들은 확률적 분석 기술들을 사용하며, 특히 기대값(expected value)을 활용한다. 이 용어들은 다른 문맥에서 활용된다; 예를 들어 최악/최선의 전염병 확산 결과, 전자 회로가 방출하는 최악의 경우 온도 등. 특정 내성 요소들이 사용되는 곳에서, 장비들은 최악의 경우 내성과 외부 조건 안에서 적절히 작동하도록 디자인 되어야 한다. In computer science, best, worst, and average cases of a given algorithm express what the resource usage is at least, at most and on average, respectively. Usually the resource being considered is running time, i.e. time complexity, but could also be memory or some other resource.Best case is the function which performs the minimum number of steps on input data of n elements. Worst case is the function which performs the maximum number of steps on input data of size n. Average case is the function which performs an average number of steps on input data of n elements. In real-time computing, the worst-case execution time is often of particular concern since it is important to know how much time might be needed in the worst case to guarantee that the algorithm will always finish on time. Average performance and worst-case performance are the most used in algorithm analysis. Less widely found is best-case performance, but it does have uses: for example, where the best cases of individual tasks are known, they can be used to improve the accuracy of an overall worst-case analysis. Computer scientists use probabilistic analysis techniques, especially expected value, to determine expected running times. The terms are used in other contexts; for example the worst- and best-case outcome of an epidemic, worst-case temperature to which an electronic circuit element is exposed, etc. Where components of specified tolerance are used, devices must be designed to work properly with the worst-case combination of tolerances and external conditions. Na ciência da computação, melhor caso, pior caso, e o caso médio de um determinado algoritmo, expressa a quantidade de recurso usado nesse algoritmo, no mínimo, no máximo e em média, respectivamente. Normalmente, o recurso a ser considerado é o tempo de execução, isto é, complexidade do tempo, porém poderia ser também a quantidade de memória usada ou outros recursos. No tempo real da computação, o pior caso em tempo de execução é muitas vezes motivo de especial preocupação, pois é importante saber quanto tempo pode ser necessário no pior caso para garantir que um algoritmo sempre termine no tempo. O desempenho médio e o desempenho do pior caso são os mais utilizados na analíse de algoritmo. O menos usado é o desempenho do melhor caso. Porém existe uso para ele: por exemplo, quando se conhece os melhores casos das tarefas individuais, eles podem ser usados para melhorar a precisão da análise do pior caso. Cientistas da computação usam técnicas de análise probabilística, especialmente a do valor esperado, para determinar o tempos de execução esperado. Esses termos são usados em outros contextos; por exemplo o pior e o melhor caso do resultado de um planejamento para a epidemia, o pior caso da temperatura à qual um elemento de um circuito eletrônico é exposto, etc. Em lugares onde componentes com especificas tolerância são utilizados, os dispositivos devem ser feitos para funcionar corretamente em um pior caso da combinação de tolerâncias e das condições externas.
prov:wasDerivedFrom: wikipedia-en:Best,_worst_and_average_case?oldid=1113464102&ns=0
dbo:wikiPageLength: 13017
foaf:isPrimaryTopicOf: wikipedia-en:Best,_worst_and_average_case

Subject Item: dbr:Cuckoo_hashing
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:Cycle_basis
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:Incompressibility_method
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:Analysis_of_algorithms
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:One-way_function
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:Order_statistic_tree
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:Glossary_of_computer_science
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:Context-sensitive_user_interface
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:Competitive_analysis_(online_algorithm)
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:Computational_complexity_theory
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:Kshetram_vadyam
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:Average_performance
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case
dbo:wikiPageRedirects: dbr:Best,_worst_and_average_case

Subject Item: dbr:BCET_(computing)
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case
dbo:wikiPageRedirects: dbr:Best,_worst_and_average_case

Subject Item: dbr:Timsort
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:Travelling_salesman_problem
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:Case
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case
dbo:wikiPageDisambiguates: dbr:Best,_worst_and_average_case

Subject Item: dbr:Linked_data_structure
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:Algorithmic_complexity_attack
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:Fluctuat
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:Brodal_queue
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:Best,_worst,_and_average_case
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case
dbo:wikiPageRedirects: dbr:Best,_worst_and_average_case

Subject Item: dbr:Best,_worst_&_average_case
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case
dbo:wikiPageRedirects: dbr:Best,_worst_and_average_case

Subject Item: dbr:Graph_isomorphism_problem
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:Asymptotically_optimal_algorithm
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:Atmospheric_entry
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:Interval_finite_element
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:JetPAG
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:Worst-case_scenario_(disambiguation)
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:Dijkstra's_algorithm
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:Average-case_complexity
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:Port_knocking
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:Sorting_algorithm
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:Merge_algorithm
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:Mastermind_(board_game)
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:Simplex_algorithm
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:Y-fast_trie
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:Exponential_time_hypothesis
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:ITP_method
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:List_of_terms_relating_to_algorithms_and_data_structures
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case

Subject Item: dbr:Average-case
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case
dbo:wikiPageRedirects: dbr:Best,_worst_and_average_case

Subject Item: dbr:Average-case_cost
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case
dbo:wikiPageRedirects: dbr:Best,_worst_and_average_case

Subject Item: dbr:Average_(performance)
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case
dbo:wikiPageRedirects: dbr:Best,_worst_and_average_case

Subject Item: dbr:Average_case
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case
dbo:wikiPageRedirects: dbr:Best,_worst_and_average_case

Subject Item: dbr:Average_case_analysis
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case
dbo:wikiPageRedirects: dbr:Best,_worst_and_average_case

Subject Item: dbr:Worst-case
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case
dbo:wikiPageRedirects: dbr:Best,_worst_and_average_case

Subject Item: dbr:Worst-case_(performance)
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case
dbo:wikiPageRedirects: dbr:Best,_worst_and_average_case

Subject Item: dbr:Worst-case_cost
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case
dbo:wikiPageRedirects: dbr:Best,_worst_and_average_case

Subject Item: dbr:Worst-case_performance
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case
dbo:wikiPageRedirects: dbr:Best,_worst_and_average_case

Subject Item: dbr:Worst_case
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case
dbo:wikiPageRedirects: dbr:Best,_worst_and_average_case

Subject Item: dbr:Best-case_analysis
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case
dbo:wikiPageRedirects: dbr:Best,_worst_and_average_case

Subject Item: dbr:Best-case_complexity
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case
dbo:wikiPageRedirects: dbr:Best,_worst_and_average_case

Subject Item: dbr:Best-case_cost
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case
dbo:wikiPageRedirects: dbr:Best,_worst_and_average_case

Subject Item: dbr:Best-case_performance
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case
dbo:wikiPageRedirects: dbr:Best,_worst_and_average_case

Subject Item: dbr:Best_and_worst_cases
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case
dbo:wikiPageRedirects: dbr:Best,_worst_and_average_case

Subject Item: dbr:Best_case
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case
dbo:wikiPageRedirects: dbr:Best,_worst_and_average_case

Subject Item: dbr:Best_case_analysis
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case
dbo:wikiPageRedirects: dbr:Best,_worst_and_average_case

Subject Item: dbr:Best_case_complexity
dbo:wikiPageWikiLink: dbr:Best,_worst_and_average_case
dbo:wikiPageRedirects: dbr:Best,_worst_and_average_case

Subject Item: wikipedia-en:Best,_worst_and_average_case
foaf:primaryTopic: dbr:Best,_worst_and_average_case