<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="uz">
	<id>https://ziyosfera.uz/index.php?action=history&amp;feed=atom&amp;title=Quicksort</id>
	<title>Quicksort - Oʻzgarishlar tarixi</title>
	<link rel="self" type="application/atom+xml" href="https://ziyosfera.uz/index.php?action=history&amp;feed=atom&amp;title=Quicksort"/>
	<link rel="alternate" type="text/html" href="https://ziyosfera.uz/index.php?title=Quicksort&amp;action=history"/>
	<updated>2026-11-21T02:01:51Z</updated>
	<subtitle>Ziyosferadagi mazkur sahifaning oʻzgarishlar tarixi</subtitle>
	<generator>MediaWiki 1.45.1</generator>
	<entry>
		<id>https://ziyosfera.uz/index.php?title=Quicksort&amp;diff=724403&amp;oldid=prev</id>
		<title>Programmer: Oʻzbekcha Vikipediyadan (UzWiki) 100% asl holatida import qilindi.</title>
		<link rel="alternate" type="text/html" href="https://ziyosfera.uz/index.php?title=Quicksort&amp;diff=724403&amp;oldid=prev"/>
		<updated>2026-08-11T02:51:52Z</updated>

		<summary type="html">&lt;p&gt;Oʻzbekcha Vikipediyadan (UzWiki) 100% asl holatida import qilindi.&lt;/p&gt;
&lt;p&gt;&lt;b&gt;Yangi sahifa&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&amp;#039;&amp;#039;&amp;#039;Tez saralash&amp;#039;&amp;#039;&amp;#039;(quicksort) [[algoritm|algoritmi]] - [[Charlz Xoar]] tomonidan yaratilgan mashhur [[saralash algoritmi|saralash algoritmidir]]. Ushbu algoritm &amp;#039;&amp;#039;n&amp;#039;&amp;#039; ta elementdan iborat massivni eng uzogʻi bilan O(&amp;#039;&amp;#039;n&amp;#039;&amp;#039;&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt;) vaqtda saralaydi. Biroq algoritm bajarilish tezligining [[matemetik kutilma|matematik kutilmasi]]  O(&amp;#039;&amp;#039;n&amp;#039;&amp;#039;&amp;amp;nbsp;log&amp;amp;nbsp;&amp;#039;&amp;#039;n&amp;#039;&amp;#039;) ga teng va u boshqa shunday tezlikda bajariluvchi algoritmlardan tezroq ishlaydi.&lt;br /&gt;
&lt;br /&gt;
==Ishlash printsipi==&lt;br /&gt;
# Massivda ixtiyoriy tayanch element tanlaymiz.&lt;br /&gt;
# Keyin undan kichik yoki teng elementlarni uning chap tomoniga, katta elementlarni oʻng tomoniga oʻtkazamiz.&lt;br /&gt;
# 1-2-chi qadamlarni tayanch elementning oʻng va chap tomonlaridagi elementlar uchun qoʻllaymiz.&lt;br /&gt;
Algorimning 2 qadami turlicha boʻlib uning bir nechta realizatsiyalari mavjud. Ayni shu 2 qadamda elementlarni joylashtirish algoritmi tufayli algoritm saralash algoritmlari ichida eng tez ishlaydiganlaridan biridir.&lt;br /&gt;
&lt;br /&gt;
==Tez saralash (QuickSort) algoritmining javascriptdagi realizatsiyasi ==&lt;br /&gt;
&lt;br /&gt;
 &amp;#039;&amp;#039;&amp;#039;function&amp;#039;&amp;#039;&amp;#039; QuickSort(A, p, r)&lt;br /&gt;
 {&lt;br /&gt;
         &amp;#039;&amp;#039;&amp;#039;if&amp;#039;&amp;#039;&amp;#039;(p&amp;lt;r)&lt;br /&gt;
         {&lt;br /&gt;
                 &amp;#039;&amp;#039;&amp;#039;var&amp;#039;&amp;#039;&amp;#039; q = Partition(A, p, r);&lt;br /&gt;
                 QuickSort(A, p, q);&lt;br /&gt;
                 QuickSort(A, q+1, r);&lt;br /&gt;
         }&lt;br /&gt;
 }&lt;br /&gt;
 &amp;#039;&amp;#039;&amp;#039;function&amp;#039;&amp;#039;&amp;#039; Partition(A, p, r)&lt;br /&gt;
 {&lt;br /&gt;
         &amp;#039;&amp;#039;&amp;#039;var&amp;#039;&amp;#039;&amp;#039; x = A[r];&lt;br /&gt;
         &amp;#039;&amp;#039;&amp;#039;var&amp;#039;&amp;#039;&amp;#039; i=p-1;&lt;br /&gt;
         &amp;#039;&amp;#039;&amp;#039;for&amp;#039;&amp;#039;&amp;#039;(&amp;#039;&amp;#039;&amp;#039;var&amp;#039;&amp;#039;&amp;#039; j=p; j&amp;lt;=r ;j++ )&lt;br /&gt;
         {&lt;br /&gt;
                 &amp;#039;&amp;#039;&amp;#039;if&amp;#039;&amp;#039;&amp;#039;(A[j] &amp;lt;= x)&lt;br /&gt;
                 {&lt;br /&gt;
                         i++;&lt;br /&gt;
                         &amp;#039;&amp;#039;&amp;#039;var&amp;#039;&amp;#039;&amp;#039; temp = A[i];&lt;br /&gt;
                         A[i] = A[j];&lt;br /&gt;
                         A[j] = temp;&lt;br /&gt;
                 }&lt;br /&gt;
         }&lt;br /&gt;
         &amp;#039;&amp;#039;&amp;#039;return&amp;#039;&amp;#039;&amp;#039; i&amp;lt;r ?i : i-1;&lt;br /&gt;
 }&lt;br /&gt;
=== [[C]] ===&lt;br /&gt;
 &amp;#039;&amp;#039;&amp;#039;void&amp;#039;&amp;#039;&amp;#039; swap(&amp;#039;&amp;#039;&amp;#039;int&amp;#039;&amp;#039;&amp;#039; *a, &amp;#039;&amp;#039;&amp;#039;int&amp;#039;&amp;#039;&amp;#039; *b)&lt;br /&gt;
 { &lt;br /&gt;
   &amp;#039;&amp;#039;&amp;#039;int&amp;#039;&amp;#039;&amp;#039; t=*a; *a=*b; *b=t; &lt;br /&gt;
 }&lt;br /&gt;
 &amp;#039;&amp;#039;&amp;#039;void&amp;#039;&amp;#039;&amp;#039; sort(&amp;#039;&amp;#039;&amp;#039;int&amp;#039;&amp;#039;&amp;#039; arr[], &amp;#039;&amp;#039;&amp;#039;int&amp;#039;&amp;#039;&amp;#039; beg, &amp;#039;&amp;#039;&amp;#039;int&amp;#039;&amp;#039;&amp;#039; end) &lt;br /&gt;
 /* sort elements arr[beg],...,arr[end-1]*/&lt;br /&gt;
 {&lt;br /&gt;
   &amp;#039;&amp;#039;&amp;#039;int&amp;#039;&amp;#039;&amp;#039; middle,l,r;&lt;br /&gt;
   &amp;#039;&amp;#039;&amp;#039;if&amp;#039;&amp;#039;&amp;#039; (end &amp;gt; beg + 1) &lt;br /&gt;
   {&lt;br /&gt;
     middle=arr[(beg+end)/2];&lt;br /&gt;
     l=beg;r=end;&lt;br /&gt;
     &amp;#039;&amp;#039;&amp;#039;while&amp;#039;&amp;#039;&amp;#039; (l &amp;lt; r) &lt;br /&gt;
     {&lt;br /&gt;
       &amp;#039;&amp;#039;&amp;#039;while&amp;#039;&amp;#039;&amp;#039; (arr[l]&amp;lt;middle) l++;&lt;br /&gt;
       &amp;#039;&amp;#039;&amp;#039;while&amp;#039;&amp;#039;&amp;#039; (arr[r]&amp;gt;middle) r--;&lt;br /&gt;
       &amp;#039;&amp;#039;&amp;#039;if&amp;#039;&amp;#039;&amp;#039; (l&amp;lt;r)&lt;br /&gt;
       {&lt;br /&gt;
         swap(arr[l],arr[r]);&lt;br /&gt;
         l++;r--;&lt;br /&gt;
       }&lt;br /&gt;
     }&lt;br /&gt;
     sort(arr, beg, r);&lt;br /&gt;
     sort(arr, l, end);&lt;br /&gt;
   }&lt;br /&gt;
 }&lt;br /&gt;
&lt;br /&gt;
=== [[C plus plus|C++]] ===&lt;br /&gt;
&lt;br /&gt;
 &amp;#039;&amp;#039;#include &amp;lt;functional&amp;gt;&amp;#039;&amp;#039;&lt;br /&gt;
 &amp;#039;&amp;#039;#include &amp;lt;algorithm&amp;gt;&amp;#039;&amp;#039;&lt;br /&gt;
 &amp;#039;&amp;#039;#include &amp;lt;iterator&amp;gt;&amp;#039;&amp;#039;&lt;br /&gt;
 &lt;br /&gt;
 &amp;#039;&amp;#039;&amp;#039;template&amp;#039;&amp;#039;&amp;#039;&amp;lt; typename BidirectionalIterator, typename Compare &amp;gt;&lt;br /&gt;
 &amp;#039;&amp;#039;&amp;#039;void&amp;#039;&amp;#039;&amp;#039; quick_sort( BidirectionalIterator first, BidirectionalIterator last, Compare cmp ) {&lt;br /&gt;
   &amp;#039;&amp;#039;&amp;#039;if&amp;#039;&amp;#039;&amp;#039;( first != last ) {&lt;br /&gt;
     BidirectionalIterator left  = first;&lt;br /&gt;
     BidirectionalIterator right = last;&lt;br /&gt;
     BidirectionalIterator pivot = left++;&lt;br /&gt;
 &lt;br /&gt;
     &amp;#039;&amp;#039;&amp;#039;while&amp;#039;&amp;#039;&amp;#039;( left != right ) {&lt;br /&gt;
       &amp;#039;&amp;#039;&amp;#039;if&amp;#039;&amp;#039;&amp;#039;( cmp( *left, *pivot ) ) {&lt;br /&gt;
          ++left;&lt;br /&gt;
       } &amp;#039;&amp;#039;&amp;#039;else&amp;#039;&amp;#039;&amp;#039; {&lt;br /&gt;
          &amp;#039;&amp;#039;&amp;#039;while&amp;#039;&amp;#039;&amp;#039;( (left != --right) &amp;amp;&amp;amp; cmp( *pivot, *right ) )&lt;br /&gt;
            ;&lt;br /&gt;
          std::iter_swap( left, right );&lt;br /&gt;
       }&lt;br /&gt;
     }&lt;br /&gt;
 &lt;br /&gt;
     --left;&lt;br /&gt;
     std::iter_swap( first, left );&lt;br /&gt;
 &lt;br /&gt;
     quick_sort( first, left, cmp );&lt;br /&gt;
     quick_sort( right, last, cmp );&lt;br /&gt;
   }&lt;br /&gt;
 }&lt;br /&gt;
 &lt;br /&gt;
 &amp;#039;&amp;#039;&amp;#039;template&amp;#039;&amp;#039;&amp;#039;&amp;lt; typename BidirectionalIterator &amp;gt;&lt;br /&gt;
 &amp;#039;&amp;#039;&amp;#039;inline&amp;#039;&amp;#039;&amp;#039; &amp;#039;&amp;#039;&amp;#039;void&amp;#039;&amp;#039;&amp;#039; quick_sort( BidirectionalIterator first, BidirectionalIterator last ) {&lt;br /&gt;
   quick_sort( first, last,&lt;br /&gt;
     std::less_equal&amp;lt; typename std::iterator_traits&amp;lt; BidirectionalIterator &amp;gt;::value_type &amp;gt;()&lt;br /&gt;
   );&lt;br /&gt;
 }&lt;br /&gt;
&lt;br /&gt;
=== [[Java|Java]] ===&lt;br /&gt;
&lt;br /&gt;
 &amp;#039;&amp;#039;&amp;#039;import&amp;#039;&amp;#039;&amp;#039; java.util.Comparator;&lt;br /&gt;
 &amp;#039;&amp;#039;&amp;#039;import&amp;#039;&amp;#039;&amp;#039; java.util.Random;&lt;br /&gt;
 &lt;br /&gt;
 &amp;#039;&amp;#039;&amp;#039;public&amp;#039;&amp;#039;&amp;#039; &amp;#039;&amp;#039;&amp;#039;class&amp;#039;&amp;#039;&amp;#039; Quicksort {&lt;br /&gt;
     &amp;#039;&amp;#039;&amp;#039;public&amp;#039;&amp;#039;&amp;#039; &amp;#039;&amp;#039;&amp;#039;static&amp;#039;&amp;#039;&amp;#039; &amp;#039;&amp;#039;&amp;#039;final&amp;#039;&amp;#039;&amp;#039; Random RND = &amp;#039;&amp;#039;&amp;#039;new&amp;#039;&amp;#039;&amp;#039; Random();&lt;br /&gt;
 &lt;br /&gt;
     &amp;#039;&amp;#039;&amp;#039;private&amp;#039;&amp;#039;&amp;#039; &amp;#039;&amp;#039;&amp;#039;void&amp;#039;&amp;#039;&amp;#039; swap(Object[] array, &amp;#039;&amp;#039;&amp;#039;int&amp;#039;&amp;#039;&amp;#039; i, &amp;#039;&amp;#039;&amp;#039;int&amp;#039;&amp;#039;&amp;#039; j) {&lt;br /&gt;
         Object tmp = array[i];&lt;br /&gt;
         array[i] = array[j];&lt;br /&gt;
         array[j] = tmp;&lt;br /&gt;
     }&lt;br /&gt;
 &lt;br /&gt;
     &amp;#039;&amp;#039;&amp;#039;private&amp;#039;&amp;#039;&amp;#039; &amp;#039;&amp;#039;&amp;#039;int&amp;#039;&amp;#039;&amp;#039; partition(Object[] array, &amp;#039;&amp;#039;&amp;#039;int&amp;#039;&amp;#039;&amp;#039; begin, &amp;#039;&amp;#039;&amp;#039;int&amp;#039;&amp;#039;&amp;#039; end, Comparator cmp) {&lt;br /&gt;
         &amp;#039;&amp;#039;&amp;#039;int&amp;#039;&amp;#039;&amp;#039; index = begin + RND.nextInt(end - begin + 1);&lt;br /&gt;
         Object pivot = array[index];&lt;br /&gt;
         swap(array, index, end);	&lt;br /&gt;
         &amp;#039;&amp;#039;&amp;#039;for&amp;#039;&amp;#039;&amp;#039; (int i = index = begin; i &amp;lt; end; ++ i) {&lt;br /&gt;
             &amp;#039;&amp;#039;&amp;#039;if&amp;#039;&amp;#039;&amp;#039; (cmp.compare(array[i], pivot) &amp;lt;= 0) {&lt;br /&gt;
                 swap(array, index++, i);&lt;br /&gt;
             }&lt;br /&gt;
         }&lt;br /&gt;
         swap(array, index, end);	&lt;br /&gt;
         &amp;#039;&amp;#039;&amp;#039;return&amp;#039;&amp;#039;&amp;#039; (index);&lt;br /&gt;
     }&lt;br /&gt;
 &lt;br /&gt;
     &amp;#039;&amp;#039;&amp;#039;private&amp;#039;&amp;#039;&amp;#039; &amp;#039;&amp;#039;&amp;#039;void&amp;#039;&amp;#039;&amp;#039; qsort(Object[] array, &amp;#039;&amp;#039;&amp;#039;int&amp;#039;&amp;#039;&amp;#039; begin, &amp;#039;&amp;#039;&amp;#039;int&amp;#039;&amp;#039;&amp;#039; end, Comparator cmp) {&lt;br /&gt;
         &amp;#039;&amp;#039;&amp;#039;if&amp;#039;&amp;#039;&amp;#039; (end &amp;gt; begin) {&lt;br /&gt;
             &amp;#039;&amp;#039;&amp;#039;int&amp;#039;&amp;#039;&amp;#039; index = partition(array, begin, end, cmp);&lt;br /&gt;
             qsort(array, begin, index - 1, cmp);&lt;br /&gt;
             qsort(array, index + 1,  end,  cmp);&lt;br /&gt;
         }&lt;br /&gt;
     }&lt;br /&gt;
 &lt;br /&gt;
     &amp;#039;&amp;#039;&amp;#039;public&amp;#039;&amp;#039;&amp;#039; &amp;#039;&amp;#039;&amp;#039;void&amp;#039;&amp;#039;&amp;#039; sort(Object[] array, Comparator cmp) {&lt;br /&gt;
         qsort(array, 0, array.length - 1, cmp);&lt;br /&gt;
     }&lt;br /&gt;
 }&lt;br /&gt;
&lt;br /&gt;
=== [[Python|Python]] ===&lt;br /&gt;
&lt;br /&gt;
 &amp;#039;&amp;#039;&amp;#039;def&amp;#039;&amp;#039;&amp;#039; qsort(L):&lt;br /&gt;
    &amp;#039;&amp;#039;&amp;#039;if&amp;#039;&amp;#039;&amp;#039; L == []: &amp;#039;&amp;#039;&amp;#039;return&amp;#039;&amp;#039;&amp;#039; []&lt;br /&gt;
    &amp;#039;&amp;#039;&amp;#039;return&amp;#039;&amp;#039;&amp;#039; qsort([x &amp;#039;&amp;#039;&amp;#039;for&amp;#039;&amp;#039;&amp;#039; x &amp;#039;&amp;#039;&amp;#039;in&amp;#039;&amp;#039;&amp;#039; L[1:] &amp;#039;&amp;#039;&amp;#039;if&amp;#039;&amp;#039;&amp;#039; x&amp;lt; L[0]]) + L[0:1] + \&lt;br /&gt;
           qsort([x &amp;#039;&amp;#039;&amp;#039;for&amp;#039;&amp;#039;&amp;#039; x &amp;#039;&amp;#039;&amp;#039;in&amp;#039;&amp;#039;&amp;#039; L[1:] &amp;#039;&amp;#039;&amp;#039;if&amp;#039;&amp;#039;&amp;#039; x&amp;gt;=L[0]])&lt;br /&gt;
&lt;br /&gt;
=== [[Joy|Joy]] ===&lt;br /&gt;
&lt;br /&gt;
 &amp;#039;&amp;#039;&amp;#039;DEFINE&amp;#039;&amp;#039;&amp;#039; sort == [small][]&lt;br /&gt;
                [uncons [&amp;gt;] split]&lt;br /&gt;
                [[swap] dip cons concat] binrec .&lt;br /&gt;
&lt;br /&gt;
===[[PHP]]===&lt;br /&gt;
&lt;br /&gt;
 &amp;#039;&amp;#039;&amp;#039;function&amp;#039;&amp;#039;&amp;#039; quicksort($seq) {&lt;br /&gt;
   &amp;#039;&amp;#039;&amp;#039;if&amp;#039;&amp;#039;&amp;#039;(count($seq)&amp;gt;1) {&lt;br /&gt;
     $k = $seq[0];&lt;br /&gt;
     $x = array();&lt;br /&gt;
     $y = array();&lt;br /&gt;
     &amp;#039;&amp;#039;&amp;#039;for&amp;#039;&amp;#039;&amp;#039;($i=1; $i&amp;lt;count($seq); $i++) {&lt;br /&gt;
       &amp;#039;&amp;#039;&amp;#039;if&amp;#039;&amp;#039;&amp;#039;($seq[$i] &amp;lt;= $k) {&lt;br /&gt;
         $x[] = $seq[$i];&lt;br /&gt;
       } &amp;#039;&amp;#039;&amp;#039;else&amp;#039;&amp;#039;&amp;#039; {&lt;br /&gt;
         $y[] = $seq[$i];&lt;br /&gt;
       }&lt;br /&gt;
     }&lt;br /&gt;
     $x = quicksort($x);&lt;br /&gt;
     $y = quicksort($y);&lt;br /&gt;
     &amp;#039;&amp;#039;&amp;#039;return&amp;#039;&amp;#039;&amp;#039; array_merge($x, array($k), $y);&lt;br /&gt;
   } &amp;#039;&amp;#039;&amp;#039;else&amp;#039;&amp;#039;&amp;#039; {&lt;br /&gt;
     &amp;#039;&amp;#039;&amp;#039;return&amp;#039;&amp;#039;&amp;#039; $seq;&lt;br /&gt;
   }&lt;br /&gt;
 }&lt;br /&gt;
&lt;br /&gt;
=== [[Haskell|Haskell]] ===&lt;br /&gt;
&lt;br /&gt;
  sort :: (Ord a)   =&amp;gt; [a] -&amp;gt; [a]&lt;br /&gt;
  &lt;br /&gt;
  sort []           = []&lt;br /&gt;
  sort (pivot:rest) = sort [y | y &amp;lt;- rest, y &amp;lt; pivot]&lt;br /&gt;
                      ++ [pivot] ++ &lt;br /&gt;
                      sort [y | y &amp;lt;- rest, y &amp;gt;=pivot]&lt;br /&gt;
&lt;br /&gt;
=== [[Prolog|Prolog]] ===&lt;br /&gt;
&lt;br /&gt;
 &amp;#039;&amp;#039;&amp;#039;split&amp;#039;&amp;#039;&amp;#039;(H, [A|X], [A|Y], Z) :-&lt;br /&gt;
   &amp;#039;&amp;#039;&amp;#039;order&amp;#039;&amp;#039;&amp;#039;(A, H), &amp;#039;&amp;#039;&amp;#039;split&amp;#039;&amp;#039;&amp;#039;(H, X, Y, Z).&lt;br /&gt;
 &amp;#039;&amp;#039;&amp;#039;split&amp;#039;&amp;#039;&amp;#039;(H, [A|X], Y, [A|Z]) :-&lt;br /&gt;
   &amp;#039;&amp;#039;&amp;#039;not&amp;#039;&amp;#039;&amp;#039;(&amp;#039;&amp;#039;&amp;#039;order&amp;#039;&amp;#039;&amp;#039;(A, H)), &amp;#039;&amp;#039;&amp;#039;split&amp;#039;&amp;#039;&amp;#039;(H, X, Y, Z).&lt;br /&gt;
 &amp;#039;&amp;#039;&amp;#039;split&amp;#039;&amp;#039;&amp;#039;(_, [], [], []).&lt;br /&gt;
 &lt;br /&gt;
 quicksort([], X, X).&lt;br /&gt;
 &lt;br /&gt;
 quicksort([H|T], S, X) :-&lt;br /&gt;
   &amp;#039;&amp;#039;&amp;#039;split&amp;#039;&amp;#039;&amp;#039;(H, T, A, B),&lt;br /&gt;
   quicksort(A, S, [H|Y]),&lt;br /&gt;
   quicksort(B, Y, X).&lt;br /&gt;
&lt;br /&gt;
=== [[Ruby|Ruby]] ===&lt;br /&gt;
&lt;br /&gt;
 &amp;#039;&amp;#039;&amp;#039;def&amp;#039;&amp;#039;&amp;#039; sort(array)&lt;br /&gt;
   &amp;#039;&amp;#039;&amp;#039;return&amp;#039;&amp;#039;&amp;#039; [] &amp;#039;&amp;#039;&amp;#039;if&amp;#039;&amp;#039;&amp;#039; array.empty?&lt;br /&gt;
   left, right = array[1..-1].partition { |y| y &amp;lt;= array.first }&lt;br /&gt;
   sort(left) + [ array.first ] + sort(right)&lt;br /&gt;
 &amp;#039;&amp;#039;&amp;#039;end&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
=== [[Standard ML|SML]] ===&lt;br /&gt;
&lt;br /&gt;
 &amp;#039;&amp;#039;&amp;#039;fun&amp;#039;&amp;#039;&amp;#039; quicksort lt lst =&lt;br /&gt;
   &amp;#039;&amp;#039;&amp;#039;let&amp;#039;&amp;#039;&amp;#039; val rec sort =&lt;br /&gt;
     fn [] =&amp;gt; []&lt;br /&gt;
      | (x::xs) =&amp;gt;&lt;br /&gt;
         &amp;#039;&amp;#039;&amp;#039;let&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
           val (left,right) = List.partition (fn y =&amp;gt; lt (y, x)) xs&lt;br /&gt;
         &amp;#039;&amp;#039;&amp;#039;in&amp;#039;&amp;#039;&amp;#039; sort left @ x :: sort right&lt;br /&gt;
         &amp;#039;&amp;#039;&amp;#039;end&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
   &amp;#039;&amp;#039;&amp;#039;in&amp;#039;&amp;#039;&amp;#039; sort lst&lt;br /&gt;
 &amp;#039;&amp;#039;&amp;#039;end&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
[[Turkum:Saralash algoritmlari]]&lt;br /&gt;
&lt;br /&gt;
[[no:Sorteringsalgoritme#Quick sort]]&lt;/div&gt;</summary>
		<author><name>Programmer</name></author>
	</entry>
</feed>