{var%20f='http://v.t.sina.com.cn/share/share.php?appkey=1515056452',u=z||d.location,p=['&url=',e(u),'&title=',e(t||d.title),'&source=',e(r),'&sourceUrl=',e(l),'&content=',c||'gb2312','&pic=',e(p||'')].join('');function%20a(){if(!window.open([f,p].join(''),'mb',['toolbar=0,status=0,resizable=1,width=440,height=430,left=',(s.width-440)/2,',top=',(s.height-430)/2].join('')))u.href=[f,p].join('');};if(/Firefox/.test(navigator.userAgent))setTimeout(a,0);else%20a();})(screen,document,encodeURIComponent,'','','https://www.manongdao.com/data/attach/logo/logo.png', '推荐 相关推荐>> 的问题《What does Õ (omicron tilde) mean in complexity Õ(n》','https://www.manongdao.com/q-317275.html','页面编码gb2312|utf-8默认gb2312'));){kind=link}
I've never seen this notation for complexity: Õ(n).
It comes up in the context of learning in stochastic algorithms.
Anyone know this notation? You can't exactly google this...
EDIT: SOLVED
I think people have pointed out the right answer below. In my case Õ() is used to hide an exponential growth of a tree.
It is shorthand for O(g(n) log^k g(n))
Actually, you can google this!
It is a variant of big-O that ignores logarithmic factors. See this wikipedia entry, which I found simply by googling that character and looking at the top entry.