Main

related bits

0

processing priority

4

site type

3 (personal blog or private political site, e.g. Blogspot, Substack, also small blogs on own domains)

review version

11

html import

20 (imported)

Events

first seen date

2024-12-31 19:45:33

expired found date

-

created at

2024-12-31 19:45:33

updated at

2026-01-16 13:34:31

Domain name statistics

length

27

crc

14858

tld

2211

nm parts

0

nm random digits

0

nm rare letters

0

Connections

is subdomain of id

13642151 (wordpress.com)

previous id

0

replaced with id

0

related id

-

dns primary id

0

dns alternative id

0

lifecycle status

0 (unclassified, or currently active)

Subdomains and pages

deleted subdomains

0

page imported products

0

page imported random

0

page imported parking

0

Error counters

count skipped due to recent timeouts on the same server IP

0

count content received but rejected due to 11-799

0

count dns errors

0

count cert errors

0

count timeouts

0

count http 429

0

count http 404

0

count http 403

0

count http 5xx

0

next operation date

-

Server

server bits

server ip

-

Mainpage statistics

mp import status

20

mp rejected date

-

mp saved date

-

mp size orig

124701

mp size raw text

19918

mp inner links count

16

mp inner links status

20 (imported)

Open Graph

title

Giri Kuncoro

description

A Cornellian Journey

site name

Giri Kuncoro

author

updated

2026-01-15 05:12:29

raw text

Giri Kuncoro | A Cornellian Journey Giri Kuncoro A Cornellian Journey Menu Skip to content See my official website Standard Posted by Giri Kuncoro Posted on November 5, 2015 Posted under oprekan Comments Leave a comment Implementing Quicksort in Python Just like Mergesort, Quicksort is another favorite sorting algorithm with best case O(n logn) but worst case O(n^2). However, compare to merge sort, this algorithm doesn’t use extra space at all. Find the article on wikipedia if you haven’t seen this algorithm yet: https://en.wikipedia.org/wiki/Quicksort The idea is as below: Pick pivot number (any number, but someone said pick middle or random to minimize the worst case) Reorder the array so that elements less than pivot come before the pivot, and elements greater than pivot come after. After this, pivot is in its final position. This process is called partitioning. Recursively apply the above to sublists elements with smaller values and separatel...

Text analysis

redirect type

0 (-)

block type

0 (no issues)

detected language

1 (English)

category id

230

index version

2025123101

spam phrases

0

Text statistics

text nonlatin

0

text cyrillic

0

text characters

13479

text words

3368

text unique words

590

text lines

549

text sentences

111

text paragraphs

61

text words per sentence

30

text matched phrases

2

text matched dictionaries

3

RSS

rss status

32 (unknown)

rss found date

2024-12-31 19:45:34

rss size orig

18091

rss items

10

rss spam phrases

0

rss detected language

1 (English)

inbefore feed id

-

inbefore status

0 (new)

Sitemap

sitemap status

40 (completed successful import of reports.txt file to table in_pages)

sitemap review version

2

sitemap urls count

69

sitemap urls adult

0

sitemap filtered products

0

sitemap filtered videos

0

sitemap found date

2024-12-31 19:45:34

sitemap process date

2025-03-23 18:28:32

sitemap first import date

-

sitemap last import date

2025-08-05 06:36:06